Record number :

679400

Title of article :

Repotting the Geraniums:On Nested Graph Transformation Rules

Author/Authors :

Arend Rensink and Jan-Hendrik Kuperus، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2009

Pages :

15

From page :

1

To page :

15

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 :

Parallel Rules , Nested Rules , Quantified Rules , Rule Amalgamation , Graph transformation , Geraniums

Journal title :

Electronic Communications of the EASST

Serial Year :

2009

Link To Document :