Communicating sequential processes
Communicating sequential processes
A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Mapping Fusion and Synchronized Hyperedge Replacement into logic programming
Theory and Practice of Logic Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Synchronization Algebras with Mobility for Graph Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Synchronized hyperedge replacement for heterogeneous systems
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Ugo Montanari and Graph Transformation
Concurrency, Graphs and Models
Synchronous Multiparty Synchronizations and Transactions
Concurrency, Graphs and Models
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
| Hi-index | 0.00 |
We compare the expressive power of Hoare (i.e., CSP style) and Milner (i.e., CCS style) synchronizations for defining graph transformations in a framework where edges can perform actions on adjacent nodes to synchronize their evolutions. Furthermore, nodes can be communicated and merged. We show that the expressive powers of the two synchronization models are different, but no one is greater than the other. Finally, we show that in many interesting cases the behaviour of a synchronization model can be mimicked by the other one using suitable translations for the rewritten graphs.