@inproceedings{f4e779c72b854b2aa4e312f0c36047c5,
title = "Termination analysis for graph transformation systems",
abstract = "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.",
author = "H.J.S. Bruggink and B. K{\"o}nig and H. Zantema",
year = "2014",
doi = "10.1007/978-3-662-44602-7_15",
language = "English",
isbn = "978-3-662-44601-0",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "179--194",
editor = "J. Diaz and I. Lanese and D. Sangiorgi",
booktitle = "Theoretical Computer Science (8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings)",
address = "Germany",
note = "8th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science; 2014-09-01; 2014-09-03 ; Conference date: 01-09-2014 Through 03-09-2014",
}