Generalised compositionality in graph transformation

A.H. Ghamarian, Arend Rensink

  • 3 Citations

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
StatePublished - 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

Fingerprint

Chemical analysis
Communication

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

Ghamarian, A.H.; Rensink, Arend / Generalised compositionality in graph transformation.

Enschede : Centre for Telematics and Information Technology (CTIT), 2012. 21 p. (CTIT Technical Report Series; No. TR-CTIT-12-17).

Research output: ProfessionalReport

@book{d9214c061a1e4d3c8a965eb83df54f07,
title = "Generalised compositionality in graph transformation",
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.",
keywords = "EWI-22118, IR-84351, Compositionality, Graph Transformation, METIS-287958, FMT-SEMANTICS",
author = "A.H. Ghamarian and Arend Rensink",
year = "2012",
month = "7",
series = "CTIT Technical Report Series",
publisher = "Centre for Telematics and Information Technology (CTIT)",
number = "TR-CTIT-12-17",
address = "Netherlands",

}

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

Generalised compositionality in graph transformation. / Ghamarian, A.H.; Rensink, Arend.

Enschede : Centre for Telematics and Information Technology (CTIT), 2012. 21 p. (CTIT Technical Report Series; No. TR-CTIT-12-17).

Research output: ProfessionalReport

TY - BOOK

T1 - Generalised compositionality in graph transformation

AU - Ghamarian,A.H.

AU - Rensink,Arend

PY - 2012/7/1

Y1 - 2012/7/1

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

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

KW - EWI-22118

KW - IR-84351

KW - Compositionality

KW - Graph Transformation

KW - METIS-287958

KW - FMT-SEMANTICS

M3 - Report

T3 - CTIT Technical Report Series

BT - Generalised compositionality in graph transformation

PB - Centre for Telematics and Information Technology (CTIT)

ER -

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