Repotting the Geraniums: On Nested Graph Transformation Rules

Share/Save/Bookmark

Rensink, Arend and Kuperus, Jan-Hendrik (2009) Repotting the Geraniums: On Nested Graph Transformation Rules. In: Eighth International Workshop on Graph Transformation and Visual Modeling Techniques, GT-VMT, 28-29 March 2009, York, U.K..

open access
[img]
Preview
PDF
340kB
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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/68252
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page