Grammars
Here you can find a number of larger GROOVE rule systems; among others, they include cases that were used in published papers.
Note: The rule systems below are frozen after uploading. This means that they may correspond to an older GROOVE version, and may need conversion before loading.
Formal Definition of a General Ontology Pattern Language Using a Graph Grammar (FedCSIS 2017)
This is the Ontology Pattern Grammar reported in that paper:
How Much are your Geraniums? Taking Graph Conditions beyond First Order (2017)
This is the rule system of the geranium experiment reported in that paper:
A Tutorial on Graph Transformation (2017)
This is the rule system of the leader election protocol used as running example in that paper:
Graph Subsumption in Abstract State Space Exploration (GRAPHITE 2012)
These are the grammars used in the performance experiments presented in this paper published in the GRAPHITE 2012 workshop:
Knowledge-based Graph Exploration Analysis (AGTIVE 2011)
This is the rule system of the running example given in this paper submitted to AGTIVE 2011:
- Feature Model: grammar encoding a problem from the feature model domain and showing the use of the new Prolog extension.
Transformation Tool Contest (TTC 2011)
Here are the GROOVE submissions to TTC 2011, as pdf and GROOVE grammars:
- Hello World case: the submitted paper, the greeting rules and the other rules.
- Compiler optimisation case: the submitted paper and rules for task 1 and task 2.
Modelling and analysis using GROOVE (STTT 2011)
This paper (electronic version here) uses the following rule systems:
- AntWorld: grammar encoding a particular model of ant behaviour.
- BPEL to BPMN: encoding of a model transformation from BPEL to BPMN.
- Leader Election: specification of a leader election protocol.
- Security Analysis: grammar allowing the analysis of security policies.
Isomorphism Checking for Symmetry Reduction (Technical Report, 2010)
This paper (electronic version here) reports experiments based on the following rule system:
- No-hops gossiping network: Model of a gossiping network with push and pull modes.
Applying Formal Methods to Gossiping Networks with mCRL and Groove (ACM SIGMETRICS 2008)
This paper (electronic version here) reports experiments based on the following rule system:
- No-hops gossiping network: Model of a gossiping network with push and pull modes.
Ludo: A Case Study for Graph Transformation Tools (AGTIVE 2007)
This paper (electronic version here) reports experiments based on the following rule system:
- Ludo: GROOVE solution of the Ludo game.
Isomorphism Checking in GROOVE (GraBaTs 2006)
This paper (electronic version here) reports experiments based on the following rule systems:
- Gossiping Girls: A model of the “gossiping girls” problem using rule priorities. Here is another, improved version of the rule system using nested rules.
- List append: An encoding of a simple recursive function appending elements to a given list.
- Mutual exclusion: A model of a token-based mutual exclusion algorithm
