Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
From MaRDI portal
(Redirected from Publication:3512494)
Recommendations
- Well-structured graph transformation systems
- Well-structured graph transformation systems with negative application conditions
- A general framework for well-structured graph transformation systems
- On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
Cites work
- Abstract graph transformation
- Algebraic approach to single-pushout graph transformation
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Graph minors. XX: Wagner's conjecture
- scientific article; zbMATH DE number 1863175 (Why is no real title available?)
- Well-structured transition systems everywhere!
Cited in
(10)- Liveness in broadcast networks
- Ideal abstractions for well-structured transition systems
- Well-structured graph transformation systems with negative application conditions
- Synthesis for Structure Rewriting Systems
- A general framework for well-structured graph transformation systems
- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
- Automatic Verification of Directory-Based Consistency Protocols
- Regular separability of well-structured transition systems
- scientific article; zbMATH DE number 7379291 (Why is no real title available?)
- Well-structured graph transformation systems
This page was built for publication: Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512494)