Termination Criteria for DPO Transformations with Injective Matches

详细信息    查看全文

• 作者：Tihamé ; r Levendovszky ; Ulrike Prange ; Hartmut Ehrig
• 关键词：Termination Criteria ; Graph Transformation ; Model Transformation ; DPO Approach
• 刊名：Electronic Notes in Theoretical Computer Science
• 出版年：2007
• 出版时间：9 July 2007
• 年：2007
• 卷：175
• 期：4
• 页码：87-100
• 全文大小：365 K

文摘

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.