Termination of graph rewriting is undecidable
Fundamenta Informaticae
Handbook of graph grammars and computing by graph transformation
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
An incremental unique representation for regular trees
Nordic Journal of Computing
Match-Bounded String Rewriting Systems
Applicable Algebra in Engineering, Communication and Computing
Termination of High-Level Replacement Units with Application to Model Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
High-level replacement units and their termination properties
Journal of Visual Languages and Computing
Termination criteria for model transformation
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Termination analysis of model transformations by petri nets
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Towards a model transformation intent catalog
Proceedings of the First Workshop on the Analysis of Model Transformations
Verification of Model Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite 'creation chains', that is chains of edges in different graphs of the reduction sequence, such that each edge is involved in creating the next edge. In our approach, the length of such creation chains is recorded by associating with each edge label a creation depth, which denotes the minimal length of a creation chain from an edge in the initial graph to that edge. We develop an algorithm which can prove the absence of such infinite chains (and therefore termination), analyse problems of the approach and propose possible solutions.