Reachability in Graph Transformation Systems and Slice Languages

DOI10.1007/978-3-319-21145-9_8zbMath1321.68339OpenAlexW992078834MaRDI QIDQ2947215

Mateus de Oliveira Oliveira

Publication date: 22 September 2015

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21145-9_8

zbMATH Keywords

reachabilitygraph transformation systemsslice languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for the verification of infinite-state graph transformation systems
• Parallelism and concurrency of graph manipulations
• Context-free graph grammars and concatenation of graphs
• Finite graph automata for linear and boundary graph languages
• Graph transformation for specification and programming
• Fundamentals of algebraic graph transformation
• Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs
• Canonizable Partial Order Generators
• Explicit State Model Checking for Graph Grammars
• On the Recognizability of Arrow and Graph Languages
• Graph expressions and graph rewritings
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• Cutwidth I: A linear time fixed parameter algorithm
• Hasse Diagram Generators and Petri Nets

This page was built for publication: Reachability in Graph Transformation Systems and Slice Languages