Abstract
| Original language | Undefined |
|---|---|
| Place of Publication | Enschede |
| Publisher | Centre for Telematics and Information Technology (CTIT) |
| Number of pages | 18 |
| State | Published - 31 Jan 2012 |
Publication series
| Name | CTIT Technical Report Series |
|---|---|
| Publisher | University of Twente, Centre for Telematics and Information Technology |
| No. | TR-CTIT-12-04 |
| ISSN (Print) | 1381-3625 |
Fingerprint
Keywords
- Compositionality
- Graph Transformation
- FMT-MC: MODEL CHECKING
- METIS-285115
- Soundness and Completeness
- IR-79646
- EWI-21480
Cite this
}
Graph Passing in Graph Transformation. / Ghamarian, A.H.; Rensink, Arend.
Enschede : Centre for Telematics and Information Technology (CTIT), 2012. 18 p. (CTIT Technical Report Series; No. TR-CTIT-12-04).Research output: Professional › Report
TY - BOOK
T1 - Graph Passing in Graph Transformation
AU - Ghamarian,A.H.
AU - Rensink,Arend
PY - 2012/1/31
Y1 - 2012/1/31
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 - Compositionality
KW - Graph Transformation
KW - FMT-MC: MODEL CHECKING
KW - METIS-285115
KW - Soundness and Completeness
KW - IR-79646
KW - EWI-21480
M3 - Report
T3 - CTIT Technical Report Series
BT - Graph Passing in Graph Transformation
PB - Centre for Telematics and Information Technology (CTIT)
ER -