A calculus of mobile processes, II
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The π-calculus [6] has introduced in concurrency the concept of link mobility, namely the possibility of communicating values which can afterwards be used as communication means (i.e. channels). Since the original work on the π-calculus, many variants and related paradigms have been introduced, including the asynchronous π-calculus [1,4,5], the π-calculus with input-guarded choice [8], the π-calculus with internal communication [11], the Fusion Calculus [10], and the Join Calculus [2,3]. In general, these variants introduce restrictions that allow for a simpler formal treatment, and/or a more direct modeling of some of the features of distributed systems (like asynchronous communication). Some recent results [7,9] suggest that the expressive power of these variants can be very different when distribution constraints are taken into consideration. In this talk, I will focus on the relative expressiveness of some of these variants, and discuss possible approaches to their distributed implementation.