Generalised compositionality in graph transformation

A.H. Ghamarian, Arend Rensink

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

    9 Downloads (Pure)

    Abstract

    We present a notion of composition applying both to graphs and to rules, based on graph and rule interfaces along which they are glued. The current paper generalises a previous result in two different ways. Firstly, rules do not have to form pullbacks with their interfaces; this enables graph passing between components, meaning that components may “learn‿ and “forget‿ subgraphs through communication with other components. Secondly, composition is no longer binary; instead, it can be repeated for an arbitrary number of components.
    Original languageUndefined
    Title of host publication6th International Conference on Graph Transformation (ICGT 2012)
    EditorsH Ehrig, G. Engels, H.J. Kreowski, G. Rozenberg
    Place of PublicationBerlin
    PublisherSpringer
    Pages234-248
    Number of pages15
    ISBN (Print)978-3-642-33653-9
    DOIs
    Publication statusPublished - Sep 2012

    Publication series

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

    Keywords

    • METIS-289737
    • Abstract Interpretation
    • Abstraction
    • EWI-22379
    • Graph Transformation
    • State Space Exploration
    • IR-83371

    Cite this