Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation

Biermann, Enrico; Ehrig, Hartmut; Ermel, Claudia; Golas, Ulrike; Taentzer, Gabriele

doi:10.1007/978-3-642-17322-6_7

Cited by 19 publications

(10 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Complement Rule and Multi-Amalgamation Theorems in this paper are valid in adhesive and weak adhesive HLR categories for n rules with application conditions [15]. These generalizations are non-trivial and important for applications of parallel graph transformations to communication-based systems [7], to model transformations from BPMN to BPEL [17], and for the modeling of the operational semantics of visual languages [8], where interaction schemes are used to generate multi-amalgamated rules and transformations based on suitable maximal matchings. The theory of multi-amalgamation is a solid mathematical basis to analyze interesting properties of the operational semantics, like termination, local confluence, and functional behavior.…”

Section: Resultsmentioning

confidence: 99%

Multi-Amalgamation in Adhesive Categories

Golas

Ehrig

Habel

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalization of the operational semantics of statecharts and other visual modeling languages, where typed attributed graphs are used for multiple rules with general application conditions. However, the theory of amalgamation for the double pushout approach has been developed up to now only on a set-theoretical basis for pairs of standard graph rules without any application conditions. For this reason, we present the theory of amalgamation in this paper in the framework of adhesive categories for a bundle of rules with (nested) application conditions. In fact, it is also valid for weak adhesive HLR categories. The main result is the Multi-Amalgamation Theorem, which generalizes the well-known Parallelism and Amalgamation Theorems to the case of multiple synchronized parallelism. The constructions are illustrated by a small running example. A more complex case study for the operational semantics of statecharts based on multi-amalgamation is presented in a separate paper.

show abstract

Section: Resultsmentioning

confidence: 99%

Multi-Amalgamation in Adhesive Categories

Golas

Ehrig

Habel

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [1], the classical concept of amalgamated graph transformations [2,29] is extended to multi-amalgamation and applied to model transformation.…”

Section: Related Workmentioning

confidence: 99%

Customizing model migrations by rule schemes

Mantz¹,

Taentzer

Lamo³

2013

Proceedings of the 2013 International Workshop on Principles of Software Evolution

Self Cite

View full text Add to dashboard Cite

Model-driven engineering (MDE) is a software engineering discipline focusing on models as the primary artifacts in the software development process while programs are mainly generated by means of model-to-code transformations. In particular, modeling languages tailored to specific application domains promise to increase the productivity and quality of software development. Nevertheless due to e.g. evolving requirements, modeling languages and their meta-models evolve which means that existing models have to be migrated correspondingly. In our approach, such co-evolutions are specified as related graph transformations ensuring welltyped model migration results. Based on our earlier work on co-transformations, we now consider the automatic deduction of migration rule schemes from given meta-model evolution rules. Rule schemes form the basis for user customizations on a high abstraction level. A rule scheme deduction algorithm is presented and several customized migration schemes for different co-evolution examples are discussed.

show abstract

“…Compared to our approach, this increases flexibility but also complexity. A related approach is amalgamation [2], where fragments of a rule can be denoted as being allowed to be matched arbitrarily many times. In this manner, a single rule can be also expanded at runtime by matching such fragments as often as necessary.…”

Section: Related Workmentioning

confidence: 99%

Modularizing Triple Graph Grammars Using Rule Refinement

Anjorin

Saller

Lochau

et al. 2014

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. Model transformation plays a central role in Model-Driven Engineering. In application scenarios such as tool integration or view specification, bidirectionality is a crucial requirement. Triple Graph Grammars (TGGs) are a formally founded, bidirectional transformation language, which has been used successfully in various case studies from different applications domains.In practice, supporting the maintainability of TGGs is a current challenge and existing modularity concepts, e.g., to avoid pattern duplication in TGG rules, are still inadequate. Existing TGG tools either provide no support at all for modularity, or provide limited support with restrictions that are often not applicable.In this paper, we present and formalize a novel modularity concept for TGGs: Rule refinement, which generalizes existing modularity concepts, solves the problem of pattern duplication, and enables concise, maintainable specifications.

show abstract

Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation

Cited by 19 publications

References 8 publications

Multi-Amalgamation in Adhesive Categories

Multi-Amalgamation in Adhesive Categories

Customizing model migrations by rule schemes

Modularizing Triple Graph Grammars Using Rule Refinement

Contact Info

Product

Resources

About