Communicating sequential processes
Communicating sequential processes
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Specification of Graph Translators with Triple Graph Grammars
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
On Termination of Graph Rewriting
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Termination Criteria for DPO Transformations with Injective Matches
Electronic Notes in Theoretical Computer Science (ENTCS)
Transformation of UML Models to CSP: A Case Study for Graph Transformation Tools
Applications of Graph Transformations with Industrial Relevance
Termination of High-Level Replacement Units with Application to Model Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Combining graph transformation and algebraic specification into model transformation
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
| Hi-index | 0.00 |
The functional behaviour of a graph transformation system is a crucial property in several application domains including model transformations and visual language engineering. Termination is one of the ingredients of functional behaviour and thus equally important. However, the termination of graph transformation systems is generally undecidable. Hence, most of the published termination criteria focus on specific classes of graph transformations. Unfortunately graph transformations with lots of production rules usually do not fit into one of these classes. It would be advantageous if different sets of the production rules in the graph transformation system could be verified using different criteria. This paper addresses this problem by providing structural conditions on the rules enabling such combination of termination criteria.