A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
A calculus of mobile processes, II
Information and Computation
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Zero-safe nets: comparing the collective and individual token approaches
Information and Computation - Special issue on EXPRESS 1997
Foundations of Logic Programming
Foundations of Logic Programming
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Observational Equivalence for Synchronized Graph Rewriting with Mobility
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A Theory of Bisimulation for the pi-Calculus
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Synchronization Algebras with Mobility for Graph Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
A Category of Explicit Fusions
Concurrency, Graphs and Models
Synchronization Algebras with Mobility for Graph Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process calculus, the Fusion Calculus, graph transformations in the Synchronized Hyperedge Replacement with Hoare synchronization (HSHR) approach and logic programming. We present a translation from Fusion Calculus into HSHR (whereas Fusion Calculus uses Milner synchronization) and prove a correspondence between the reduction semantics of Fusion Calculus and HSHR transitions. We also present a mapping from HSHR into a transactional version of logic programming and prove that there is a full correspondence between the two formalisms. The resulting mapping from Fusion Calculus to logic programming is interesting since it shows the tight analogies between the two formalisms, in particular for handling name generation and mobility. The intermediate step in terms of HSHR is convenient since graph transformations allow for multiple, remote synchronizations, as required by Fusion Calculus semantics.