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. © 2014 IFIP International Federation for Information Processing.
CITATION STYLE
Bruggink, H. J. S., König, B., & Zantema, H. (2014). Termination analysis for graph transformation systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8705 LNCS, pp. 179–194). Springer Verlag. https://doi.org/10.1007/978-3-662-44602-7_15
Mendeley helps you to discover research relevant for your work.