Well-structured graph transformation systems
From MaRDI portal
Publication:729812
DOI10.1016/j.ic.2016.03.005zbMath1355.68140OpenAlexW2298187920MaRDI QIDQ729812
Publication date: 22 December 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2016.03.005
Related Items (1)
Cites Work
- Unnamed Item
- Symbolic graphs for attributed graph constraints
- Graph minors. XX: Wagner's conjecture
- Graph minors XXIII. Nash-Williams' immersion conjecture
- A theory of structural stationarity in the \(\pi\)-calculus
- Fundamentals of algebraic graph transformation
- The Power of Well-Structured Systems
- Well-Structured Graph Transformation Systems with Negative Application Conditions
- Bounds on Mobility
- A General Framework for Well-Structured Graph Transformation Systems
- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Parameterized Verification of Ad Hoc Networks
- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs
- Subgraphs and well‐quasi‐ordering
- Handbook of Graph Grammars and Computing by Graph Transformation
- Decidability of Safety in Graph-Based Models for Access Control
- On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
- Structural Counter Abstraction
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
- Ordering by Divisibility in Abstract Algebras
- Well-structured transition systems everywhere!
This page was built for publication: Well-structured graph transformation systems
