%0 Conference Proceedings
%T Termination Analysis for Graph Transformation Systems
%+ Universität Duisburg-Essen = University of Duisburg-Essen [Essen]
%+ Radboud University [Nijmegen]
%A Bruggink, H., Sander
%A König, Barbara
%A Zantema, Hans
%Z Part 2: Track B: Logic, Semantics, Specification and Verification
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 8th IFIP International Conference on Theoretical Computer Science (TCS)
%C Rome, Italy
%Y Josep Diaz
%Y Ivan Lanese
%Y Davide Sangiorgi
%I Springer
%3 Theoretical Computer Science
%V LNCS-8705
%P 179-194
%8 2014-09-01
%D 2014
%R 10.1007/978-3-662-44602-7_15
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z TC 2
%Z WG 2.2
%2 https://inria.hal.science/hal-01402041/document
%2 https://inria.hal.science/hal-01402041/file/978-3-662-44602-7_15_Chapter.pdf
%L hal-01402041
%U https://inria.hal.science/hal-01402041
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC2
%~ IFIP-LNCS-8705
%~ IFIP-TCS
%~ IFIP-WG2-2