Proving termination of graph transformation systems using weighted type graphs over semirings
We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a...
| Main Authors: | , , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
s.n.
2015
|
| Subjects: | |
| Online Access: | https://research.tue.nl/en/publications/6ac573aa-71de-4214-80c0-9920bfd63592 https://pure.tue.nl/ws/files/3860268/568819185029266.pdf |
| Summary: | We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a framework which includes the tropical and arctic type graphs introduced in a previous paper and a new variant of arithmetic type graphs. These type graphs can be used to assign weights to graphs and to show that these weights decrease in every rewriting step in order to prove termination. We present an example involving counters and discuss the implementation in the tool Grez. |
|---|