Compositionality in Graph Transformation

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

    8 Citations (Scopus)


    Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules. From process algebra, on the other hand, we know the principle of reactivity, meaning that the system being modelled is embedded in an environment with which it continually interacts. This has the advantage of allowing modular system specifications and correspondingly smaller descriptions of individual components. Reactivity can alternatively be understood as enabling compositionality: the specification of components and subsystems are composed to obtain the complete model. In this work we show a way to ingest graph transformation with compositionality, reaping the same benefits from modularity as enjoyed by process algebra. In particular, using the existing concept of graph interface, we show under what circumstances rules can be decomposed into smaller subrules, each working on a subgraph of the complete, whole-world graph, in such a way that the effect of the original rule is precisely captured by the synchronisation of subrules.
    Original languageEnglish
    Title of host publicationAutomata, Languages and Programming
    Subtitle of host publication37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings
    EditorsSamson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis
    Place of PublicationBerlin
    Number of pages12
    ISBN (Electronic)978-3-642-14162-1
    ISBN (Print)978-3-642-14161-4
    Publication statusPublished - Jul 2010
    Event37th International Colloquium on Automata, Languages and Programming, ICALP 2010 - Bordeaux, France
    Duration: 6 Jul 201010 Jul 2010
    Conference number: 37

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Conference37th International Colloquium on Automata, Languages and Programming, ICALP 2010
    Abbreviated titleICALP


    • IR-72351
    • EWI-18023
    • METIS-270857


    Dive into the research topics of 'Compositionality in Graph Transformation'. Together they form a unique fingerprint.

    Cite this