EEMCS EPrints Service
Ghamarian, A.H. and Rensink, A. (2012) Generalised compositionality in graph transformation. In: 6th International Conference on Graph Transformation (ICGT 2012), 24-29 Sep 2012, Bremen, Germany. pp. 234-248. Lecture Notes in Computer Science 7562. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-33653-9
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-642-33654-6_16
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.
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item