Towards a Systematic Method for Proving Termination of Graph Transformation Systems

DOI10.1016/j.entcs.2008.04.072zbMath1283.68203OpenAlexW2097428454MaRDI QIDQ5403457

H. J. Sander Bruggink

Publication date: 26 March 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.072

zbMATH Keywords

terminationgraph transformation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperedge replacement: grammars and languages
• Match-bounded string rewriting systems
• Termination of term rewriting using dependency pairs
• Termination Criteria for DPO Transformations with Injective Matches
• A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property
• Termination Analysis of Model Transformations by Petri Nets
• Handbook of Graph Grammars and Computing by Graph Transformation
• Finite family developments
• Essentials of Term Graph Rewriting
• Fundamental Approaches to Software Engineering

This page was built for publication: Towards a Systematic Method for Proving Termination of Graph Transformation Systems