Generalised compositionality in graph transformation

A.H. Ghamarian, Arend Rensink

    Research output: Book/ReportReportProfessional

    3 Citations (Scopus)
    50 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
    Place of PublicationEnschede
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages21
    Publication statusPublished - 1 Jul 2012

    Publication series

    NameCTIT Technical Report Series
    PublisherCentre for Telematics and Information Technology, University of Twente
    No.TR-CTIT-12-17
    ISSN (Print)1381-3625

    Keywords

    • EWI-22118
    • IR-84351
    • Compositionality
    • Graph Transformation
    • METIS-287958
    • FMT-SEMANTICS

    Cite this

    Ghamarian, A. H., & Rensink, A. (2012). Generalised compositionality in graph transformation. (CTIT Technical Report Series; No. TR-CTIT-12-17). Enschede: Centre for Telematics and Information Technology (CTIT).