Well-structured graph transformation systems with negative application conditions

DOI10.1007/978-3-642-33654-6_6MaRDI QIDQ2918974zbMATH OpenOpenAlexFDO

Authors Barbara König, Jan Stückrath

Publication date 2 October 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://nbn-resolving.org/urn:nbn:de:hbz:464-20120705-115624-1

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
• Well-structured graph transformation systems
• A general framework for well-structured graph transformation systems
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• Transformation systems with incremental negative application conditions

Cited in

(5)

• Handling infinitely branching well-structured transition systems
• A general framework for well-structured graph transformation systems
• Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
• Decidability of Resilience for Well-Structured Graph Transformation Systems
• Well-structured graph transformation systems

This page was built for publication: Well-structured graph transformation systems with negative application conditions

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