Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.entcs.2007.04.019 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
termination property,termination criterion,transformation idiom,dpo transformations,model transformation,finite input structure,real-world transformation,attribute condition,dpo approach,graph transformation,case study,termination criteria,model integrated computing,model-driven architecture,injective matches,model transformation system,software engineering,transitive closure | Graph,Discrete mathematics,Architecture,Model transformation,Injective function,Computer science,Theoretical computer science,Graph rewriting,Transitive closure | Journal |
Volume | Issue | ISSN |
175 | 4 | Electronic Notes in Theoretical Computer Science |
Citations | PageRank | References |
12 | 0.98 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tihamér Levendovszky | 1 | 185 | 14.96 |
| Ulrike Prange | 2 | 371 | 21.95 |
| Hartmut Ehrig | 3 | 3615 | 540.68 |