On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
From MaRDI portal
Publication:5111899
DOI10.4230/LIPICS.RTA.2012.101zbMATH Open1437.68077OpenAlexW2275786693MaRDI QIDQ5111899FDOQ5111899
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
Recommendations
- Decidability of Resilience for Well-Structured Graph Transformation Systems
- Reachability in graph transformation systems and slice languages
- Towards a systematic method for proving termination of graph transformation systems
- On the reachability of a version of graph-rewriting system
- Unfolding Graph Transformation Systems: Theory and Applications to Verification
- A framework for the verification of infinite-state graph transformation systems
- Verification of graph transformation systems with context-free specifications
- scientific article; zbMATH DE number 2016064
Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (9)
- Reachability in Graph Transformation Systems and Slice Languages
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- Well-structured graph transformation systems
- Decidability of Resilience for Well-Structured Graph Transformation Systems
- Title not available (Why is that?)
- Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker
- A tale of two graph models: a case study in wireless sensor networks
- Handling infinitely branching well-structured transition systems
- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
This page was built for publication: On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111899)
