Generalised compositionality in graph transformation

A.H. Ghamarian, Arend Rensink

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 Verlag
Pages234-248
Number of pages15
ISBN (Print)978-3-642-33653-9
DOIs
StatePublished - Sep 2012

Publication series

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

Fingerprint

Chemical analysis
Communication

Keywords

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

Cite this

Ghamarian, A. H., & Rensink, A. (2012). Generalised compositionality in graph transformation. In H. Ehrig, G. Engels, H. J. Kreowski, & G. Rozenberg (Eds.), 6th International Conference on Graph Transformation (ICGT 2012) (pp. 234-248). (Lecture Notes in Computer Science; Vol. 7562). Berlin: Springer Verlag. DOI: 10.1007/978-3-642-33654-6_16

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

6th International Conference on Graph Transformation (ICGT 2012). ed. / H Ehrig; G. Engels; H.J. Kreowski; G. Rozenberg. Berlin : Springer Verlag, 2012. p. 234-248 (Lecture Notes in Computer Science; Vol. 7562).

Research output: Scientific - peer-reviewConference contribution

@inbook{7071a83073554231a3b62212555a1be8,
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 = "METIS-289737, Abstract Interpretation, Abstraction, EWI-22379, Graph Transformation, State Space Exploration, IR-83371",
author = "A.H. Ghamarian and Arend Rensink",
note = "10.1007/978-3-642-33654-6_16",
year = "2012",
month = "9",
doi = "10.1007/978-3-642-33654-6_16",
isbn = "978-3-642-33653-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer Verlag",
pages = "234--248",
editor = "H Ehrig and G. Engels and H.J. Kreowski and G. Rozenberg",
booktitle = "6th International Conference on Graph Transformation (ICGT 2012)",
address = "Germany",

}

Ghamarian, AH & Rensink, A 2012, Generalised compositionality in graph transformation. in H Ehrig, G Engels, HJ Kreowski & G Rozenberg (eds), 6th International Conference on Graph Transformation (ICGT 2012). Lecture Notes in Computer Science, vol. 7562, Springer Verlag, Berlin, pp. 234-248. DOI: 10.1007/978-3-642-33654-6_16

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

6th International Conference on Graph Transformation (ICGT 2012). ed. / H Ehrig; G. Engels; H.J. Kreowski; G. Rozenberg. Berlin : Springer Verlag, 2012. p. 234-248 (Lecture Notes in Computer Science; Vol. 7562).

Research output: Scientific - peer-reviewConference contribution

TY - CHAP

T1 - Generalised compositionality in graph transformation

AU - Ghamarian,A.H.

AU - Rensink,Arend

N1 - 10.1007/978-3-642-33654-6_16

PY - 2012/9

Y1 - 2012/9

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 - METIS-289737

KW - Abstract Interpretation

KW - Abstraction

KW - EWI-22379

KW - Graph Transformation

KW - State Space Exploration

KW - IR-83371

U2 - 10.1007/978-3-642-33654-6_16

DO - 10.1007/978-3-642-33654-6_16

M3 - Conference contribution

SN - 978-3-642-33653-9

T3 - Lecture Notes in Computer Science

SP - 234

EP - 248

BT - 6th International Conference on Graph Transformation (ICGT 2012)

PB - Springer Verlag

ER -

Ghamarian AH, Rensink A. Generalised compositionality in graph transformation. In Ehrig H, Engels G, Kreowski HJ, Rozenberg G, editors, 6th International Conference on Graph Transformation (ICGT 2012). Berlin: Springer Verlag. 2012. p. 234-248. (Lecture Notes in Computer Science). Available from, DOI: 10.1007/978-3-642-33654-6_16