Pattern-Based Model-to-Model Transformation

Question

1. What contributions have the authors mentioned in the paper "Pattern-based model-to-model transformation" ?

2. What are the future works mentioned in the paper "Pattern-based model-to-model transformation" ?

3. What is the reason why the authors start with an empty target graph?

4. What is needed to guide the execution of the operational rules?

Accepted Answer

The authors present a new, high-level approach for the specification of model-to-model transformations based on declarative patterns.. In this paper the authors study one of such mechanisms based on the generation of operational triple graph grammar rules.. Moreover, the authors exploit deduction techniques at the specification level in order to generate more specialized constraints ( preserving the specification semantics ) reflecting pattern dependencies, from which additional rules can be derived.

Accepted Answer

It would be interesting to extend the set of derived operational rules to handle incremental synchronization and change propagation.

Accepted Answer

Since the authors start with an empty target graph, backwards satisfaction is also obtained.(ii) follows because S-annotation adds dependencies (which are transformed into NACs) to the initial patterns, and these are appropriately propagated to their derived patterns in step 5 of the rule generation process.

Accepted Answer

a control mechanism is needed to guide the execution of the operational rules, such as priorities [5] or their coupling to editing rules [2].

Accepted Answer

Next deduction rule is used to take into consideration the interaction of Npatterns, which express global negative constraints, with other patterns.

Accepted Answer

The authors use the notation TrG|x (for x ∈ {s, t, c}) to refer to the Gx component of TrG, and write 〈Gs, Gt〉 for a triple graph with source and target graphs Gs and Gt, and 〈Gs, ∅, Gt〉 for a triple graph with empty correspondence.

Accepted Answer

This is one of the strengths of the present work: pattern dependencies are automatically calculated and not explicitly given by the designer such as with QVT and TGGs.

Accepted Answer

The authors make such dependencies explicit by annotating patterns with additional graphs, related to the positive graph Q.Dependencies are calculated by the intersection of two patterns, and can be interpreted as restrictions that must not hold when the pattern is enforced.

Accepted Answer

Given triple injective morphism C q→ Q and sets NPre = {Q ci→ Ci}i∈Pre, NPost = {Q cj→ Cj}j∈Post of negative pre- and post-conditions:– ∧i∈Pre←− N (Ci) ⇒ P (Q) ∧ j∈Post −→ N (Cj) is a simple pattern (S-Pattern).– ∧i∈Pre←− N (Ci)∧←−P (C) ⇒ P (Q) ∧ j∈Post −→ N (Cj) is a composite pattern (C-Pattern).– −→ N (Cj) is a negative pattern (N-Pattern).

Accepted Answer

A triple graph morphism f = (fs, fc, ft) : TrG1 → TrG2 is made of three graph morphisms fx : TrG1|x → TrG2|x (with x = {s, c, t}), where fs|V ◦ cs1 = cs2 ◦ fc|V and ft|V ◦ ct1 = ct2 ◦ fc|VSource and target graphs can be typed by a type graph, or more in general by a meta-model, which includes inheritance [7].

Accepted Answer

Def. 12 (Non-Deleting Oper. TGG Rule) A TGG rule r = (L l→ R, pre = {ni : L → N iL}i∈I , post = {nj : R → N jR}j∈J) is made of an injective morphism l of triple graphs, and sets pre and post of negative pre- and post-conditions.

Accepted Answer

Most of these activities include the specification and execution of model transformations, some of them between different languages.

Accepted Answer

The generated rules: (i) produce models satisfying the specification, (ii) are confluent, (iii) terminate, and (iv) transform each source model for which there is a correct target model.

Accepted Answer

In this paper, the authors propose a purely declarative, formal approach to M2M transformation based on triple patterns to express the relations between source and target models.

Accepted Answer

Relations between source and target models are expressed as different kinds of patterns, from which operational TGG rules are derived implementing forward/backwards transformations and taking into account pattern interactions.

Pattern-Based Model-to-Model Transformation

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What contributions have the authors mentioned in the paper "Pattern-based model-to-model transformation" ?

2. What are the future works mentioned in the paper "Pattern-based model-to-model transformation" ?

3. What is the reason why the authors start with an empty target graph?

4. What is needed to guide the execution of the operational rules?

5. What is the definition of the next deduction rule?

6. What is the meaning of the notation TrG|x?

7. What is the advantage of the present work?

8. How do the authors make dependencies in patterns explicit?

9. What is the morphism of the triple graph?

10. What is the definition of a triple graph morphism?

11. What is the structure of non-deleting TGG rules?

12. What are the common activities of M2M?

13. What is the correctness of the generated rules?

14. What is the main idea of the paper?

15. What are the relations between source and target models?

Figures

Citations

Verification and validation of declarative model-to-model transformations through invariants

Diagram predicate framework: A formal approach to MDE

Formal Verification Techniques for Model Transformations: A Tridimensional Classification

Automating the transformation-based analysis of visual languages

Correctness, completeness and termination of pattern-based model-to-model transformation

References

Fundamentals of Algebraic Graph Transformation

Bidirectional model transformations in QVT: semantic issues and open questions

A Simple Game-Theoretic Approach to Checkonly QVT Relations

Satellite Events at the MoDELS 2005 Conference

Bidirectional model transformations in QVT: semantic issues and open questions

Related Papers (5)

Fundamentals of Algebraic Graph Transformation

Correctness, completeness and termination of pattern-based model-to-model transformation

HANDBOOK of GRAPH GRAMMARS and COMPUTING by GRAPH TRANSFORMATION

Pattern-Based Model-to-Model Transformation: Handling Attribute Conditions

Event-driven grammars: relating abstract and concrete levels of visual languages