Amalgamation of graph transformations: a synchronization mechanism
Journal of Computer and System Sciences
A calculus of mobile processes, I
Information and Computation
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
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
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
From algebraic graph transformation to adhesive HLR categories and systems
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
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
The edge of graph transformation: graphs for behavioural specification
Graph transformations and model-driven engineering
Hi-index | 0.00 |
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules. From process algebra, on the other hand, we know the principle of reactivity, meaning that the system being modelled is embedded in an environment with which it continually interacts. This has the advantage of allowing modular system specifications and correspondingly smaller descriptions of individual components. Reactivity can alternatively be understood as enabling compositionality: the specification of components and subsystems are composed to obtain the complete model. In this work we show a way to ingest graph transformation with compositionality, reaping the same benefits from modularity as enjoyed by process algebra. In particular, using the existing concept of graph interface, we show under what circumstances rules can be decomposed into smaller subrules, each working on a subgraph of the complete, whole-world graph, in such a way that the effect of the original rule is precisely captured by the synchronisation of subrules.