Abstract
A necessary and sufficient condition for termination of graph rewriting systems is established. Termination is equivalent to the finiteness of all forward closures, being certain minimal derivations in which each step depends on previous steps. This characterization differs from corresponding results for term rewriting in that the latter hold only for subclasses of term rewriting systems. When applied to term graph rewriting, the result characterizes termination of arbitrary term rewriting systems under graph rewriting. In particular, it captures non-terminating term rewriting systems that are terminating under graph rewriting.
Cite
CITATION STYLE
Plump, D. (1995). On termination of graph rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1017, pp. 88–100). Springer Verlag. https://doi.org/10.1007/3-540-60618-1_68
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
