Amalgamation of graph transformations: a synchronization mechanism
Journal of Computer and System Sciences
Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
Parallel high-level replacement systems
Theoretical Computer Science
Synchronized Hyperedge Replacement with Name Mobility
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
From Graph Grammars to High Level Replacement Systems
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Graph Transformation Units --- An Overview
Concurrency, Graphs and Models
Compositionality of Model Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Quasitoposes, quasiadhesive categories and artin glueing
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Multi-amalgamation in adhesive categories
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Synchronised hyperedge replacement as a model for service oriented computing
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
History-dependent automata: an introduction
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
Composition and decomposition of DPO transformations with borrowed context
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.00 |
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.