Well-structured graph transformation systems

DOI10.1016/J.IC.2016.03.005MaRDI QIDQ729812zbMATHOpenAlexFDO

Authors Barbara König, Jan Stückrath

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• A general framework for well-structured graph transformation systems
• Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
• Well-structured graph transformation systems with negative application conditions
• Well-structured transition systems everywhere!
• Sound and complete abstract graph transformation

Cites work

• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A general framework for well-structured graph transformation systems
• A theory of structural stationarity in the \(\pi\)-calculus
• Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
• Bounds on mobility
• Decidability of safety in graph-based models for access control
• Fundamentals of algebraic 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
• Handbook of Graph Grammars and Computing by Graph Transformation
• Monotonic Abstraction for Programs with Dynamic Memory Heaps
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• Ordering by Divisibility in Abstract Algebras
• Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
• Parameterized verification of ad hoc networks
• Structural Counter Abstraction
• Subgraphs and well‐quasi‐ordering
• Symbolic graphs for attributed graph constraints
• The power of well-structured systems
• Well-quasi-orders in subclasses of bounded treewidth graphs
• Well-structured graph transformation systems with negative application conditions
• Well-structured transition systems everywhere!

Cited in

(14)

• Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
• Graph Transformations
• A general framework for well-structured graph transformation systems
• Analysing graph transformation systems through constraint handling rules
• GTS families for the flexible composition of graph transformation systems
• Sound and complete abstract graph transformation
• A structural approach to graph transformation based on symmetric Petri nets
• Resilience of well-structured graph transformation systems
• Strong Joinability Analysis for Graph Transformation Systems in CHR
• Decidability of Resilience for Well-Structured Graph Transformation Systems
• Well-structured graph transformation systems with negative application conditions
• Subobject transformation systems
• scientific article; zbMATH DE number 7456049 (Why is no real title available?)
• Lessons Learned from Building a Graph Transformation System

This page was built for publication: Well-structured graph transformation systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q729812)