McGill UniversitySchool of Computer Science

Ph.D. Candidate in the Modelling, Simulation and Design Lab

The Modular TimedGraph Transformation Language

Eugene Syriani

MoTif

OVERVIEW Motivation

Language Semantic Domain

Constructs

Applications Modelling “everything”

Examples

¿What’s next? Scaleability

2

MoTif

MOTIVATION• Model Transformation Controlled Graph Rewriting

3

MoTif

SEMANTIC DOMAIN• The Discrete Event System Specification [1] (DEVS)

formalism• Highly compositional simulation framework• DEVS:– Blocks– Ports– Events

• Semantics: Parallel composition of blocks

4[1] Zeigler B.P., Multifacetted Modelling and Discrete Event Simulation/ Academic Press, London (1984)

MoTif

DEVS META-MODEL

5

MoTif

S

t

(s)

(s,0)s

s''

s'

Y

tty

y1

(s)

int(s)

X

x1

tx t

tx

(s,e)ext((s,e),x)

(s0,0) s0

0

ATOMIC DEVS

MoTif

COUPLED DEVS

7

C1A1

A2

C2

MoTif

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

8[2] Syriani E. and Vangheluwe H.: Programmed Graph Rewriting with DEVS. AGTIVE 2007, LNCS (2008)

MoTif

MOTIF META-MODEL

9

MoTif

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

10

MoTif

EXAMPLES (1)

11

MoTif

EXAMPLES (2)

(Selection Pattern)

Back-tracking

12

MoTif

EXAMPLES (3)Synchronization Pattern

13

MoTif

WORKFLOW

14

MoTif

MODEL THE TRANSFORMATION SYSTEM [3]

15

APPLICATIONS:

Model E

veryth

ing

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

MoTif

MODELLING & SIMULATION-BASED DESIGN [3]

16

APPLICATIONS:

Simulation Experiments

Synthesis of Application

Model of System

Model of Environment

Finding the optimal game speed

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

MoTif

REAL-TIME TRANSFORMATIONS (GAMES)

17

APPLICATIONS:

MoTif

ANTWORLD SIMULATION CASE STUDY [4]

18

APPLICATIONS:

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

MoTif

CD 2 RDBMS CASE STUDY

19

APPLICATIONS:

MoTif

ESSENTIAL PRIMITIVE PROPERTIES

20

MoTif

WHAT’S NEXT: SCALEABILITYHigher-order transformations

21

MoTif

WHAT’S NEXT: SCALEABILITYDeclarative bi-directional transformations

22

MoTif

WHAT’S NEXT: SCALEABILITYEfficiency

23

• Matching• Implementation• Distributed

MoTif

REFERENCES• http://www.cs.mcgill.ca/~esyria• Upcoming SoSym article

• Eugene Syriani and Hans Vangheluwe. Using MoTif for the AntWorld Simulation Tool Contest. In: Arend Rensik 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).

24