| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
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.
Cited literature [12 references]
https://hal.inria.fr/hal-01402041
Contributor : Hal Ifip <>
Submitted on : Thursday, November 24, 2016 - 10:50:38 AM
Last modification on : Thursday, November 24, 2016 - 11:14:10 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 1:05:25 PM
Contributor : Hal Ifip <>
Submitted on : Thursday, November 24, 2016 - 10:50:38 AM
Last modification on : Thursday, November 24, 2016 - 11:14:10 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 1:05:25 PM
File
978-3-662-44602-7_15_Chapter.p...
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License