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.
|Name||Electronic Communications of the EASST|
|Workshop||Eighth International Workshop on Graph Transformation and Visual Modeling Techniques, GT-VMT|
|Period||28/03/09 → 29/03/09|
|Other||28-29 March 2009|
- Graph Transformation
- Quantiefied Transformation Rules
- Nested Transformation Rules