Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Parallel and Sequential Independence for Borrowed Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
G-Reactive Systems as Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthesising CCS bisimulation using graph rewriting
Information and Computation
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Electronic Notes in Theoretical Computer Science (ENTCS)
Deriving bisimulation congruences with borrowed contexts
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Compositionality in graph transformation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The edge of graph transformation: graphs for behavioural specification
Graph transformations and model-driven engineering
Generalised compositionality in graph transformation
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Hi-index | 0.00 |
Double-pushout (DPO) transformations with borrowed context extend the standard DPO approach by allowing part of the graph needed in a transformation to be borrowed from the environment. The bisimilarity based on the observation of borrowed contexts is a congruence, thus facilitating system analysis. In this paper, focusing on the situation in which the states of a global system are built out of local components, we show that DPO transformations with borrowed context defined on a global system state can be decomposed into corresponding transformations on the local states and vice versa. Such composition and decomposition theorems, developed in the framework of adhesive categories, can be seen as a first step towards an inductive definition, in sos style, of the labelled transition system associated to a graph transformation system. As a special case we show how an ordinary DPO transformation on a global system state can be decomposed into local DPO transformations with borrowed context using the same production.