Abstract

Graph transformation works under the whole world assumption. Therefore, in realistic systems, both the individual graphs and the set of all such graphs can grow very large. In reactive formalisms such as process algebra, on the other hand, each system is split into smaller components which continually interact; the interactions pass information such as names or locations between components. The state spaces for the separate components are typically much smaller, and much efficiency can be gained by analysing system behaviour on this level. In this paper we present a framework for compositional graph transformation inspired by name-passing calculi, in which (knowledge about) subgraphs can be passed between components. Essentially, we define graph-passing (reactive) component rules and their composition into traditional (reductive) whole-world rules. This extends previous work in which a simpler form of composition was proposed. The main result is a soundness and completeness result for the composition, showing that the transformations induced by the component rules and their whole-world counterparts are equivalent.
Original languageUndefined
Title of host publication11th International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2012
EditorsAndrew Fish, Leen Lambers
Place of PublicationBerlin
PublisherEuropean Association for Software Science and Technology
Pages723:1-723:14
Number of pages14
StatePublished - Mar 2012

Publication series

NameElectronic Communications of the EASST
PublisherEuropean Association for Software Science and Technology
Volume47
ISSN (Print)1863-2122
ISSN (Electronic)1863-2122

Fingerprint

Chemical analysis
Algebra

Keywords

  • Graph TransformationCompositionality
  • Graph Transformation
  • Soundness and Completeness
  • METIS-296259
  • IR-84315
  • Compositionality
  • EWI-22970

Cite this

Ghamarian, A. H., & Rensink, A. (2012). Graph passing in graph transformation. In A. Fish, & L. Lambers (Eds.), 11th International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2012 (pp. 723:1-723:14). (Electronic Communications of the EASST; Vol. 47). Berlin: European Association for Software Science and Technology.

Ghamarian, A.H.; Rensink, Arend / Graph passing in graph transformation.

11th International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2012. ed. / Andrew Fish; Leen Lambers. Berlin : European Association for Software Science and Technology, 2012. p. 723:1-723:14 (Electronic Communications of the EASST; Vol. 47).

Research output: Scientific - peer-reviewConference contribution

@inbook{45cd2c5ca97143c999a6bf0ce36f08bf,
title = "Graph passing in graph transformation",
abstract = "Graph transformation works under the whole world assumption. Therefore, in realistic systems, both the individual graphs and the set of all such graphs can grow very large. In reactive formalisms such as process algebra, on the other hand, each system is split into smaller components which continually interact; the interactions pass information such as names or locations between components. The state spaces for the separate components are typically much smaller, and much efficiency can be gained by analysing system behaviour on this level. In this paper we present a framework for compositional graph transformation inspired by name-passing calculi, in which (knowledge about) subgraphs can be passed between components. Essentially, we define graph-passing (reactive) component rules and their composition into traditional (reductive) whole-world rules. This extends previous work in which a simpler form of composition was proposed. The main result is a soundness and completeness result for the composition, showing that the transformations induced by the component rules and their whole-world counterparts are equivalent.",
keywords = "Graph TransformationCompositionality, Graph Transformation, Soundness and Completeness, METIS-296259, IR-84315, Compositionality, EWI-22970",
author = "A.H. Ghamarian and Arend Rensink",
year = "2012",
month = "3",
series = "Electronic Communications of the EASST",
publisher = "European Association for Software Science and Technology",
pages = "723:1--723:14",
editor = "Andrew Fish and Leen Lambers",
booktitle = "11th International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2012",

}

Ghamarian, AH & Rensink, A 2012, Graph passing in graph transformation. in A Fish & L Lambers (eds), 11th International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2012. Electronic Communications of the EASST, vol. 47, European Association for Software Science and Technology, Berlin, pp. 723:1-723:14.

Graph passing in graph transformation. / Ghamarian, A.H.; Rensink, Arend.

11th International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2012. ed. / Andrew Fish; Leen Lambers. Berlin : European Association for Software Science and Technology, 2012. p. 723:1-723:14 (Electronic Communications of the EASST; Vol. 47).

Research output: Scientific - peer-reviewConference contribution

TY - CHAP

T1 - Graph passing in graph transformation

AU - Ghamarian,A.H.

AU - Rensink,Arend

PY - 2012/3

Y1 - 2012/3

N2 - Graph transformation works under the whole world assumption. Therefore, in realistic systems, both the individual graphs and the set of all such graphs can grow very large. In reactive formalisms such as process algebra, on the other hand, each system is split into smaller components which continually interact; the interactions pass information such as names or locations between components. The state spaces for the separate components are typically much smaller, and much efficiency can be gained by analysing system behaviour on this level. In this paper we present a framework for compositional graph transformation inspired by name-passing calculi, in which (knowledge about) subgraphs can be passed between components. Essentially, we define graph-passing (reactive) component rules and their composition into traditional (reductive) whole-world rules. This extends previous work in which a simpler form of composition was proposed. The main result is a soundness and completeness result for the composition, showing that the transformations induced by the component rules and their whole-world counterparts are equivalent.

AB - Graph transformation works under the whole world assumption. Therefore, in realistic systems, both the individual graphs and the set of all such graphs can grow very large. In reactive formalisms such as process algebra, on the other hand, each system is split into smaller components which continually interact; the interactions pass information such as names or locations between components. The state spaces for the separate components are typically much smaller, and much efficiency can be gained by analysing system behaviour on this level. In this paper we present a framework for compositional graph transformation inspired by name-passing calculi, in which (knowledge about) subgraphs can be passed between components. Essentially, we define graph-passing (reactive) component rules and their composition into traditional (reductive) whole-world rules. This extends previous work in which a simpler form of composition was proposed. The main result is a soundness and completeness result for the composition, showing that the transformations induced by the component rules and their whole-world counterparts are equivalent.

KW - Graph TransformationCompositionality

KW - Graph Transformation

KW - Soundness and Completeness

KW - METIS-296259

KW - IR-84315

KW - Compositionality

KW - EWI-22970

M3 - Conference contribution

T3 - Electronic Communications of the EASST

SP - 723:1-723:14

BT - 11th International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2012

PB - European Association for Software Science and Technology

ER -

Ghamarian AH, Rensink A. Graph passing in graph transformation. In Fish A, Lambers L, editors, 11th International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2012. Berlin: European Association for Software Science and Technology. 2012. p. 723:1-723:14. (Electronic Communications of the EASST).