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.
|Name||Lecture Notes in Computer Science|
|Conference||8th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science; 2014-09-01; 2014-09-03|
|Period||1/09/14 → 3/09/14|
|Other||8th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science|