VIATRA2/GraTS
Overview
This is the website for VIATRA2/GRaTS, a stochastic graph transformation system simulator built in co-operation between the VIATRA2 Group and Dr. Paolo Torrini from Prof. Reiko Heckel's group at the University of Leicester.
GraTS implements a framework to run discrete-event stochastic simulations of semi-Markov processes based on generalised stochastic graph transformation. Graph transformation rules are used to define observable events that lead from one state to another (action rules), as well as quantitative observations over states (probe rules). GraTS enables the execution of structured simulation experiments made of multiple batches of bounded runs, allowing for variations in sensitive parameters that may include maximum length. It can compute statistics about action rule application, timing, probe rule values and covariance matrix, based on different forms of aggregation of the observations throughout an experiment.
GraTS is implemented in Java as a functionality of VIATRA2, a rule-based language interpreter based on abstract state machines and incremental pattern matching, available as an Eclipse plugin. GraTS relies on the implementation of graph transformation given by VIATRA2, taking advantage of incremental pattern matching to deal efficiently with semi-Markov processes. GraTS uses the SSJ libraries to deal with random number generation, distribution functions, confidence intervals and other statistics. GraTS also allows for the visualisation of individual runs, based on graph visualisation as provided in Eclipse by Zest.
Obtaining GRaTS
Currently, GRaTS is only available as a set of source projects that you need to check out from SVN and then run an "Eclipse Application" run configuration from your workspace.
Requirements: Java 1.6.x, Eclipse 3.6, a recent version of VIATRA2.
Check out everything from
Simulation project samples can then be checked out from
Documentation
The most current documentation is attached to this page.
Publications
Hosted at BUTE
- Torrini-Heckel-Ráth: Stochastic simulation of graph transformation systems (FASE 2010)
- Torrini-Heckel-Ráth-Bergmann: Stochastic graph transformation with regions (GT-VMT 2010)
- Bergmann-Boronat-Torrini-Heckel-Ráth-Varró: Advances in model transformation by graph transformation - Specification, Analysis and Execution (a chapter in the SENSORIA Book 2010)
-
Bergmann-Ráth-Szabó-Torrini-Varró: Incremental pattern matching for the efficient computation of transitive closure (Accepted at ICGT2012)
- see the online addendum here
Hosted at ULE
- Khan-Torrini-Heckel: Model-based Simulation of VoIP Network Reconfigurations using Graph Transformation Systems (ICGT2008) Download
- Khan-Heckel-Torrini-Ráth: Model-based stochastic simulation of P2P VoIP using graph transformation system Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications ( ASMTA 2010) Download
- Khan-Heckel: Model-based stochastic simulation of Super Peer Promotion in P2P VoIP using graph transformation Proceedings of International Confrence on Data Communication Networking (DCNET 2011) (DBLP)
