On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
From MaRDI portal
Publication:5111899
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
Cited in
(11)- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
- Handling infinitely branching well-structured transition systems
- Resilience of well-structured graph transformation systems
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- Declarative parameterized verification of distributed protocols via the Cubicle model checker
- Decidability of Resilience for Well-Structured Graph Transformation Systems
- Well-structured graph transformation systems with negative application conditions
- Reachability in graph transformation systems and slice languages
- Well-structured graph transformation systems
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- A tale of two graph models: a case study in wireless sensor networks
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)
