@inproceedings{1c2245d06a6043319f096da1f46d1790,

title = "Repotting the geraniums: on nested graph transformation rules",

abstract = "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.",

keywords = "METIS-263949, Graph Transformation, EWI-15800, IR-68252, Quantiefied Transformation Rules, Nested Transformation Rules",

author = "Arend Rensink and Jan-Hendrik Kuperus",

year = "2009",

language = "Undefined",

isbn = "1863-2122",

series = "Electronic Communications of the EASST",

publisher = "European Association for the Study of Science and Technology",

pages = "--",

editor = "A. Boronat and R. Heckel",

booktitle = "Graph transformation and visual modelling techniques",

address = "Netherlands",

}