Termination Analysis for Graph Transformation Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Termination Analysis for Graph Transformation Systems


We introduce two techniques for proving termination of graph transformation systems. We do not fix a single initial graph, but consider arbitrary initial graphs (uniform termination), but also certain sets of initial graphs (non-uniform termination). The first technique, which can also be used to show non-uniform termination, uses a weighted type graph to assign weights to graphs. The second technique reduces uniform termination of graph transformation systems of a specific form to uniform termination of cycle rewriting, a variant of string rewriting.
Fichier principal
Vignette du fichier
978-3-662-44602-7_15_Chapter.pdf (357.32 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01402041 , version 1 (24-11-2016)




H. Sander Bruggink, Barbara König, Hans Zantema. Termination Analysis for Graph Transformation Systems. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.179-194, ⟨10.1007/978-3-662-44602-7_15⟩. ⟨hal-01402041⟩
57 View
132 Download



Gmail Mastodon Facebook X LinkedIn More