Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems

DOI10.1007/978-3-540-70545-1_21zbMath1155.68410OpenAlexW1552190776MaRDI QIDQ3512494

Salil Joshi, Barbara König

Publication date: 15 July 2008

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70545-1_21

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Grammars and rewriting systems (68Q42)

Related Items (7)

Ideal Abstractions for Well-Structured Transition Systems ⋮ Synthesis for Structure Rewriting Systems ⋮ Liveness in broadcast networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Well-structured graph transformation systems ⋮ Automatic Verification of Directory-Based Consistency Protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic approach to single-pushout graph transformation
• Graph minors. XX: Wagner's conjecture
• Graph minors XXIII. Nash-Williams' immersion conjecture
• Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
• Well-structured transition systems everywhere!

This page was built for publication: Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems