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.
|Place of Publication||Enschede|
|Publisher||Centre for Telematics and Information Technology (CTIT)|
|Number of pages||21|
|Publication status||Published - 1 Jul 2012|
|Name||CTIT Technical Report Series|
|Publisher||Centre for Telematics and Information Technology, University of Twente|
- Graph Transformation
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).