Reachability in graph transformation systems and slice languages

DOI10.1007/978-3-319-21145-9_8MaRDI QIDQ2947215zbMATH OpenOpenAlexFDO

Authors 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

graph transformation systemsreachabilityslice languages

Mathematics Subject Classification ID

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

Recommendations

• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• Graph Transformation in Constant Time
• On the reachability of a version of graph-rewriting system
• Termination analysis for graph transformation systems
• The complexity of connectivity problems on context-free graph languages

Cites work

• A framework for the verification of infinite-state graph transformation systems
• Canonizable partial order generators
• Context-free graph grammars and concatenation of graphs
• Cutwidth I: A linear time fixed parameter algorithm
• Explicit State Model Checking for Graph Grammars
• Finite graph automata for linear and boundary graph languages
• Fundamentals of algebraic graph transformation
• Graph expressions and graph rewritings
• Graph transformation for specification and programming
• Hasse diagram generators and Petri nets
• scientific article; zbMATH DE number 512804 (Why is no real title available?)
• scientific article; zbMATH DE number 919845 (Why is no real title available?)
• scientific article; zbMATH DE number 1437942 (Why is no real title available?)
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• On the Recognizability of Arrow and Graph Languages
• Parallelism and concurrency of graph manipulations
• Subgraphs satisfying MSO properties on z-topologically orderable digraphs

Cited in

(3)

• Attacking the Dimensionality Problem of Parameterized Systems via Bounded Reachability Graphs
• Graph Transformation in Constant Time
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems

This page was built for publication: Reachability in graph transformation systems and slice languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947215)