Towards a systematic method for proving termination of graph transformation systems

DOI10.1016/J.ENTCS.2008.04.072MaRDI QIDQ5403457zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Termination analysis for graph transformation systems
• Proving termination of graph transformation systems using weighted type graphs over semirings
• Modular termination of graph transformation
• Combining termination criteria by isolating deletion
• scientific article; zbMATH DE number 1183250

Cites work

• scientific article; zbMATH DE number 1183250 (Why is no real title available?)
• scientific article; zbMATH DE number 2006493 (Why is no real title available?)
• A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property
• An incremental unique representation for regular trees
• Essentials of term graph rewriting
• Finite family developments
• Fundamental Approaches to Software Engineering
• Handbook of Graph Grammars and Computing by Graph Transformation
• Hyperedge replacement: grammars and languages
• Match-bounded string rewriting systems
• Termination Analysis of Model Transformations by Petri Nets
• Termination criteria for DPO transformations with injective matches
• Termination of term rewriting using dependency pairs

Cited in

(9)

• Termination analysis for graph transformation systems
• Proving termination of graph transformation systems using weighted type graphs over semirings
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• Certifying a Termination Criterion Based on Graphs, without Graphs
• A framework for the verification of infinite-state graph transformation systems
• Combining termination proofs in model transformation systems
• Combining termination criteria by isolating deletion
• Termination of graph transformation systems using weighted subgraph counting
• Modular termination of graph transformation

This page was built for publication: Towards a systematic method for proving termination of graph transformation systems

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