• Aucun résultat trouvé

20 Years of Concurrent Model Driven Application Engineering with Triple Graph Grammars

N/A
N/A
Protected

Academic year: 2022

Partager "20 Years of Concurrent Model Driven Application Engineering with Triple Graph Grammars"

Copied!
1
0
0

Texte intégral

(1)

20 Years of Concurrent Model Driven Application Engineering with Triple Graph

Grammars (Abstract)

Andy Sch¨urr

FG Real-Time Systems Technische Universit¨at Darmstadt

Germany

Today model-driven system development is a well-established and successfully used paradigm in many engineering disciplines including e.g. mechanical, elec- trical, automation, and software engineering. Models are, therefore, used and concurrently manipulated in different disciplines at different levels of abstrac- tions across the whole lifecycle of a single product. Keeping all these models and related other engineering artefacts synchronized often turns out to be a nightmare. The situation even becomes worse when product line engineering principles are used to develop a family of products instead of a single product on top of a common platform.

Model transformation techniques promise to be a silver bullet for the con- struction and validation of reliable and efficiently working model synchronizers on a new level of abstraction. Triple Graph Grammars (TGGs) are a bidirec- tional model transformation formalism, where a single specification generates a language of related graph tuples (pairs of models) together with an intermediate correspondence graph (traceability link database). A single TGG specification is used as input for a compiler that generates batch transformations as well as incrementally working synchronizers that assist engineers in their daily work to keep networks of evolving models and their traceability relationships in a consistent state.

This talk starts with an introduction to concurrent model driven application engineering in general, explains how triple graph grammars are specified and used to generate model transformation and integration tools, and finishes with an assessment of the state-of-the-art of 20 years of TGG related research activities.

Références

Documents relatifs

Unite´ de recherche INRIA Rocquencourt, Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex Unite´ de recherche INRIA Sophia-Antipolis, 2004 route des Lucioles, BP

The premise graph of a propagated target constraint may occur with a target model at places that do not correspond to occurrences of the premise graph of the source constraint in

In this section, we provide the details of our case study. At first we present the complete TGG in Sec. C.1 for generating consistent organizational models. Thereafter, in Sec. C.5,

Forward transformation rules take the source graph as input and produce a corresponding target graph (together.. with the correspondence graph linking it to the source graph).

Class2Table synchronously creates a class in a class diagram with its corresponding table in the relational database. Accordingly, subclasses are connected to the tables of its

In this section, we define a model transformation from a variant of UML statecharts [OMG09] to Petri nets [Pet80] using triple rules and application conditions.. Statecharts may

While other model transformation approaches were applied to the same example for translation between source and target language, triple graph grammars additionally show their

The next step concerns the synchronization process: Once the change has been applied, the decomposed language is used to collect all existing and potential rule applications..