Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Information and Computation
Resource access control in systems of mobile agents
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
On the expressiveness of pure safe ambients
Mathematical Structures in Computer Science
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
Semantic barbs and biorthogonality
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
On the relative expressive power of asynchronous communication primitives
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
On the expressiveness and decidability of higher-order process calculi
Information and Computation
On the expressiveness of the π-calculus and the mobile ambients
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
| Hi-index | 0.00 |
In this paper, we comparatively analyze some mainstream calculi for mobility: asynchronous @p-calculus, distributed @p-calculus and Mobile/Boxed/Safe ambients. In particular, we focus on their relative expressive power, i.e. we try to encode one in the other while respecting some reasonable properties. According to the possibility or the impossibility for such results, we set up a hierarchy of these languages.