direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications Prof. Hartmut Ehrig (TFS)

Termination Criteria for DPO Transformations with Injective Matches
Zitatschlüssel LPE06
Autor Levendovszky, T. and Prange, U. and Ehrig, H.
Buchtitel Proceedings of Workshop on Graph Transformation and Concurrency (GT-VC 2006)
Jahr 2006
Adresse Amsterdam
Herausgeber Rensink, A. and Heckel, R. and König, B.
Verlag Elsevier Science
Zusammenfassung 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.
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe