1 / 24

The Mo dular Ti med Graph Trans f ormation Language

The Mo dular Ti med Graph Trans f ormation Language. Eugene Syriani. Overview. Motivation Language Semantic Domain Constructs Applications Modelling “everything” Examples ¿What’s next? Scaleability. Motivation. Model Transformation  Controlled Graph Rewriting. Semantic Domain.

jenaya
Download Presentation

The Mo dular Ti med Graph Trans f ormation Language

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The Modular TimedGraph Transformation Language Eugene Syriani

  2. Overview • Motivation • Language • Semantic Domain • Constructs • Applications • Modelling “everything” • Examples • ¿What’s next? • Scaleability

  3. Motivation • Model Transformation  Controlled Graph Rewriting

  4. Semantic Domain • The Discrete Event System Specification [1] (DEVS) formalism • Highly compositional simulation framework • DEVS: • Blocks • Ports • Events • Semantics: Parallel composition of blocks [1] Zeigler B.P., Multifacetted Modelling and Discrete Event Simulation/ Academic Press, London (1984)

  5. DEVS Meta-Model

  6. X Atomic DEVS x1 tx t S s'' ext((s,e),x) (s,0) (s,e) s (s) (s0,0) s0 int(s) s' 0 tx t Y (s) y1 ty t

  7. Coupled DEVS C1 A1 C2 A2

  8. Motif mapped onto DEVS [2] • Blocks • Atomic: encapsulate a graph rewriting rule • Coupled: encapsulate a set of rules, scoping • Events • Inport: receive the host graph • Outport(s): send the transformed graph [2] Syriani E. and Vangheluwe H.: Programmed Graph Rewriting with DEVS. AGTIVE 2007, LNCS (2008)

  9. MoTif Meta-Model

  10. Language constructs • AtomicRule (ARule): transformation rule application • ForAllRule (FRule): apply rule on all matches (parallel independent) • StarRule (SRule): apply rule as long as possible • TransactionalRule (XRule): control backtracking enabled • Selector: At most 1 rule is applied • Synchronizer: synchronize (merge) “threads” of rule applications • CoupledRule (CRule): parallel composition of inner models

  11. Examples (1)

  12. Examples (2) Back-tracking (Selection Pattern)

  13. Examples (3) Synchronization Pattern

  14. Workflow

  15. Applications: Model the transformation system [3] Model Everything [3] Syriani E. and Vangheluwe H.: Programmed Graph Rewriting with Time for Simulation-based Design. ICMT 2007, LNCS 5063, pp. 91-106 (2008)

  16. Applications: Modelling & simulation-based design [3] Model of System • Finding the optimal game speed Model of Environment Simulation Experiments Synthesis of Application [3] Syriani E. and Vangheluwe H.: Programmed Graph Rewriting with Time for Simulation-based Design. ICMT 2007, LNCS 5063, pp. 91-106 (2008)

  17. Applications: Real-time transformations (games)

  18. Applications: Antworld simulation case study [4] [4] Eugene Syriani and Hans Vangheluwe. Using MoTif for the AntWorld Simulation Tool Contest. In: ArendRensik and Pieter Van Ghorp (eds.) Workshop on Graph-Based Tools (GraBaTS 2008). Best Live Solution (GUI). Leicester (2008).

  19. Applications: CD 2 RDBMS case study

  20. Essential Primitive Properties

  21. What’s next: Scaleability Higher-order transformations

  22. What’s next: Scaleability Declarative bi-directional transformations

  23. What’s next: Scaleability Efficiency • Matching • Implementation • Distributed

  24. References • http://www.cs.mcgill.ca/~esyria • Upcoming SoSym article • Eugene Syriani and Hans Vangheluwe. Using MoTif for the AntWorld Simulation Tool Contest. In: ArendRensik and Pieter Van Ghorp (eds.) Workshop on Graph-Based Tools (GraBaTS 2008). Best Live Solution (GUI). Leicester (2008). • Eugene Syriani and Hans Vangheluwe. Programmed Graph Rewriting with Time for Simulation-Based Design. In Alfonso Pierantonio, Antonio Vallecillo, Jean Bézivin, Jeff Gray (eds.): ICMT 2008. LNCS, vol. 5063, pp. 91-106. Springer-Verlag, Zürich (2008). • Eugene Syriani. Programmed Graph Rewriting: MoTif, Presentation for COMP 763: Modelling and Simulation Based Design (2008). • Eugene Syriani and Hans Vangheluwe: Programmed Graph Rewriting with DEVS. In A. Schürr, M. Nagl, and A. Zündorf (Eds.): AGTIVE 2007. LNCS, vol.5088, pp. 136-152. Springer-Verlag, Kassel (2008).

More Related