Termination Criteria for DPO Transformations with Injective Matches |
| |
Authors: | Tiham r Levendovszky, Ulrike Prange,Hartmut Ehrig |
| |
Affiliation: | aDepartment of Automation and Applied Informatics, Budapest University of Technology and Economics, Hungary;bDepartment of Software Engineering and Theoretical Computer Science, Technical University of Berlin, Germany |
| |
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. |
| |
Keywords: | Termination Criteria Graph Transformation Model Transformation DPO Approach |
本文献已被 ScienceDirect 等数据库收录! |
|