Handbook of logic in computer science (vol. 4)
Fundamenta Informaticae - Special issue on graph transformations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Characterizing Behavioural Congruences for Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Bisimilarity and behaviour-preserving reconfigurations of open Petri nets
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Graphical encoding of a spatial logic for the π-calculus
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Composition and decomposition of DPO transformations with borrowed context
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.00 |
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were missing for dporewriting extended with borrowed contexts (dpobc), a formalism used for equipping dpoderivations with labels and introduced for modeling open systems that interact with the environment.In this work we propose the definition of parallel and sequential independence for dpobcrewriting, and we prove that these novel notions allow generalizing the Church-Rosser and parallelism theorems holding for dporewriting. Most importantly, we show that the dpobcversion of these theorems still guarantees the local confluence and the parallel execution of pairs of independent dpobcderivations.