Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings

DOI10.1007/978-3-319-21145-9_4zbMath1321.68326arXiv1505.01695OpenAlexW1629743385MaRDI QIDQ2947210

H. J. Sander Bruggink, Barbara König, Dennis Nolte, Hans Zantema

Publication date: 22 September 2015

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.01695

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Termination of Cycle Rewriting by Transformation and Matrix Interpretation ⋮ Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings ⋮ A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java ⋮ Unnamed Item

Uses Software

• SMT-LIB
• Grez

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix interpretations for proving termination of term rewriting
• Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings
• Termination Analysis for Graph Transformation Systems
• Arctic Termination ...Below Zero
• Termination of String Rewriting with Matrix Interpretations
• Termination Analysis of Model Transformations by Petri Nets
• Handbook of Graph Grammars and Computing by Graph Transformation
• Termination of Cycle Rewriting
• Transforming Cycle Rewriting into String Rewriting
• Fundamental Approaches to Software Engineering
• On termination of graph rewriting

This page was built for publication: Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings