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.
|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|
|Number of pages||15|
|Publication status||Published - 2009|
|Name||Electronic Communications of the EASST|
- Graph Transformation
- Quantiefied Transformation Rules
- Nested Transformation Rules
Rensink, A., & Kuperus, J-H. (2009). Repotting the geraniums: on nested graph transformation rules. In A. Boronat, & R. Heckel (Eds.), Graph transformation and visual modelling techniques (pp. -). (Electronic Communications of the EASST; Vol. 18). European Association for the Study of Science and Technology.