Repotting the geraniums: on nested graph transformation rules

Arend Rensink, Jan-Hendrik Kuperus

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    22 Citations (Scopus)
    11 Downloads (Pure)

    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.
    Original languageUndefined
    Title of host publicationGraph transformation and visual modelling techniques
    EditorsA. Boronat, R. Heckel
    PublisherEuropean Association for the Study of Science and Technology
    Pages-
    Number of pages15
    ISBN (Print)1863-2122
    Publication statusPublished - 2009

    Publication series

    NameElectronic Communications of the EASST
    PublisherEASST
    Volume18
    ISSN (Print)1863-2122

    Keywords

    • METIS-263949
    • Graph Transformation
    • EWI-15800
    • IR-68252
    • Quantiefied Transformation Rules
    • Nested Transformation Rules

    Cite this

    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.
    Rensink, Arend ; Kuperus, Jan-Hendrik. / Repotting the geraniums: on nested graph transformation rules. Graph transformation and visual modelling techniques. editor / A. Boronat ; R. Heckel. European Association for the Study of Science and Technology, 2009. pp. - (Electronic Communications of the EASST).
    @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",

    }

    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. Electronic Communications of the EASST, vol. 18, European Association for the Study of Science and Technology, pp. -.

    Repotting the geraniums: on nested graph transformation rules. / Rensink, Arend; Kuperus, Jan-Hendrik.

    Graph transformation and visual modelling techniques. ed. / A. Boronat; R. Heckel. European Association for the Study of Science and Technology, 2009. p. - (Electronic Communications of the EASST; Vol. 18).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    TY - GEN

    T1 - Repotting the geraniums: on nested graph transformation rules

    AU - Rensink, Arend

    AU - Kuperus, Jan-Hendrik

    PY - 2009

    Y1 - 2009

    N2 - 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.

    AB - 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.

    KW - METIS-263949

    KW - Graph Transformation

    KW - EWI-15800

    KW - IR-68252

    KW - Quantiefied Transformation Rules

    KW - Nested Transformation Rules

    M3 - Conference contribution

    SN - 1863-2122

    T3 - Electronic Communications of the EASST

    SP - -

    BT - Graph transformation and visual modelling techniques

    A2 - Boronat, A.

    A2 - Heckel, R.

    PB - European Association for the Study of Science and Technology

    ER -

    Rensink A, Kuperus J-H. Repotting the geraniums: on nested graph transformation rules. In Boronat A, Heckel R, editors, Graph transformation and visual modelling techniques. European Association for the Study of Science and Technology. 2009. p. -. (Electronic Communications of the EASST).