On the Decidability Status of Reachability and Coverability in Graph Transformation Systems

DOI10.4230/LIPICS.RTA.2012.101zbMath1437.68077OpenAlexW2275786693MaRDI QIDQ5111899

Arnaud Sangnier, Nathalie Bertrand, Barbara König, Giorgio Delzanno, Jan Stückrath

Publication date: 27 May 2020

Full work available at URL: https://hal.inria.fr/hal-00752446

zbMATH Keywords

reachabilitydecidabilitygraph transformation systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (8)

Reachability in Graph Transformation Systems and Slice Languages ⋮ Handling infinitely branching well-structured transition systems ⋮ Unnamed Item ⋮ Reachability analysis of reversal-bounded automata on series-parallel graphs ⋮ Decidability of Resilience for Well-Structured Graph Transformation Systems ⋮ Well-structured graph transformation systems ⋮ A tale of two graph models: a case study in wireless sensor networks ⋮ Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker

This page was built for publication: On the Decidability Status of Reachability and Coverability in Graph Transformation Systems