Graph passing in graph transformation

A.H. Ghamarian, Arend Rensink

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

    7 Downloads (Pure)

    Abstract

    Graph transformation works under the whole world assumption. Therefore, in realistic systems, both the individual graphs and the set of all such graphs can grow very large. In reactive formalisms such as process algebra, on the other hand, each system is split into smaller components which continually interact; the interactions pass information such as names or locations between components. The state spaces for the separate components are typically much smaller, and much efficiency can be gained by analysing system behaviour on this level. In this paper we present a framework for compositional graph transformation inspired by name-passing calculi, in which (knowledge about) subgraphs can be passed between components. Essentially, we define graph-passing (reactive) component rules and their composition into traditional (reductive) whole-world rules. This extends previous work in which a simpler form of composition was proposed. The main result is a soundness and completeness result for the composition, showing that the transformations induced by the component rules and their whole-world counterparts are equivalent.
    Original languageEnglish
    Title of host publication11th International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2012
    EditorsAndrew Fish, Leen Lambers
    Place of PublicationBerlin
    PublisherEuropean Association for Software Science and Technology
    Pages723:1-723:14
    Number of pages14
    Publication statusPublished - Mar 2012

    Publication series

    NameElectronic Communications of the EASST
    PublisherEuropean Association for Software Science and Technology
    Volume47
    ISSN (Print)1863-2122
    ISSN (Electronic)1863-2122

    Keywords

    • Graph transformation
    • Compositionality
    • Soundness and Completeness

    Fingerprint Dive into the research topics of 'Graph passing in graph transformation'. Together they form a unique fingerprint.

  • Cite this

    Ghamarian, A. H., & Rensink, A. (2012). Graph passing in graph transformation. In A. Fish, & L. Lambers (Eds.), 11th International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2012 (pp. 723:1-723:14). (Electronic Communications of the EASST; Vol. 47). Berlin: European Association for Software Science and Technology.