Termination Criteria for DPO Transformations with Injective Matches

Authors:
Tihamér Levendovszky;Ulrike Prange;Hartmut Ehrig
Affiliations:
Department of Automation and Applied Informatics, Budapest University of Technology and Economics, Hungary;Department of Software Engineering and Theoretical Computer Science, Technical University of Berlin, Germany;Department of Software Engineering and Theoretical Computer Science, Technical University of Berlin, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 7
Cited 7

Termination of graph rewriting is undecidable

Fundamenta Informaticae
Graph rewrite systems for program optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation

VL '00 Proceedings of the 2000 IEEE International Symposium on Visual Languages (VL'00)
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)

Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
A Systematic Approach to Metamodeling Environments and Model Transformation Systems in VMTS

Electronic Notes in Theoretical Computer Science (ENTCS)
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

Explicit State Model Checking for Graph Grammars

Concurrency, Graphs and Models
Compositionality of Model Transformations

Electronic Notes in Theoretical Computer Science (ENTCS)
A Collection Operator for Graph Transformation

ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
Towards Formal Analysis of Multi-paradigm Model Transformations

Simulation
Combining termination criteria by isolating deletion

ICGT'10 Proceedings of the 5th international conference on Graph transformations
DSLTrans: a turing incomplete transformation language

SLE'10 Proceedings of the Third international conference on Software language engineering
A collection operator for graph transformation

Software and Systems Modeling (SoSyM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integrated Computing (MIC). Termination criteria for graph and model transformation systems have become a focused area recently. This paper provides termination criteria for graph and model transformation systems with injective matches and finite input structure. It proposes a treatment for infinite sequences of rule applications, and takes attribute conditions, negative application conditions, and type constraints into account. The results are illustrated on case studies excerpted from real-world transformations, which show the termination properties of the frequently used ''transitive closure'' and ''leaf collector'' transformation idioms. An intuitive comparison with other approaches is also given.