### Abstract

Original language | Undefined |
---|---|

Title of host publication | Graph transformation and visual modelling techniques |

Editors | A. Boronat, R. Heckel |

Publisher | European Association for the Study of Science and Technology |

Pages | - |

Number of pages | 15 |

ISBN (Print) | 1863-2122 |

Publication status | Published - 2009 |

### Publication series

Name | Electronic Communications of the EASST |
---|---|

Publisher | EASST |

Volume | 18 |

ISSN (Print) | 1863-2122 |

### Keywords

- METIS-263949
- Graph Transformation
- EWI-15800
- IR-68252
- Quantiefied Transformation Rules
- Nested Transformation Rules

### Cite this

*Graph transformation and visual modelling techniques*(pp. -). (Electronic Communications of the EASST; Vol. 18). European Association for the Study of Science and Technology.

}

*Graph transformation and visual modelling techniques.*Electronic Communications of the EASST, vol. 18, European Association for the Study of Science and Technology, pp. -.

**Repotting the geraniums: on nested graph transformation rules.** / Rensink, Arend; Kuperus, Jan-Hendrik.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Repotting the geraniums: on nested graph transformation rules

AU - Rensink, Arend

AU - Kuperus, Jan-Hendrik

PY - 2009

Y1 - 2009

N2 - We propose a scheme for rule amalgamation based on nested graph predicates. Essentially, we extend all the graphs in such a predicate with right hand sides. Whenever such an enriched nested predicate matches (i.e., is satisfied by) a given host graph, this results in many individual match morphisms, and thus many “small��? rule applications. The total effect is described by the amalgamated rule. This makes for a smooth, uniform and very powerful amalgamation scheme, which we demonstrate on a number of examples. Among the examples is the following, which we believe to be inexpressible in very few other parallel rule formalism proposed in the literature: repot all flowering geraniums whose pots have cracked.

AB - We propose a scheme for rule amalgamation based on nested graph predicates. Essentially, we extend all the graphs in such a predicate with right hand sides. Whenever such an enriched nested predicate matches (i.e., is satisfied by) a given host graph, this results in many individual match morphisms, and thus many “small��? rule applications. The total effect is described by the amalgamated rule. This makes for a smooth, uniform and very powerful amalgamation scheme, which we demonstrate on a number of examples. Among the examples is the following, which we believe to be inexpressible in very few other parallel rule formalism proposed in the literature: repot all flowering geraniums whose pots have cracked.

KW - METIS-263949

KW - Graph Transformation

KW - EWI-15800

KW - IR-68252

KW - Quantiefied Transformation Rules

KW - Nested Transformation Rules

M3 - Conference contribution

SN - 1863-2122

T3 - Electronic Communications of the EASST

SP - -

BT - Graph transformation and visual modelling techniques

A2 - Boronat, A.

A2 - Heckel, R.

PB - European Association for the Study of Science and Technology

ER -