On the Relative Expressive Power of Calculi for Mobility

Electronic Notes in Theoretical Computer Science

Volumn 249, Issue , 2009, Pages 269-286

  Gorla, Daniele ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Encodings; Expressiveness; Mobility; Process Calculi

Indexed keywords

AMBIENTS; ENCODINGS; EXPRESSIVE POWER; EXPRESSIVENESS; MOBILITY; PROCESS CALCULI;

CALCULATIONS; ENCODING (SYMBOLS); PATHOLOGY;

BIOMINERALIZATION;

EID: 68549128626     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.07.094     Document Type: Article

References (26)

1. G. Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992
2. Bugliesi M., Castagna G., and Crafa S. Access Control for Mobile Agents: the Calculus of Boxed Ambients. ACM Transactions on Programming Languages and Systems 26 1 (2004) 57-124
3. Busi N., and Zavattaro G. On the expressive power of movement and restriction in pure mobile ambients. Theoretical Computer Science 322 3 (2004) 477-515
4. Carbone M., and Maffeis S. On the expressive power of polyadic synchronisation in π-calculus. Nordic Journal of Computing 10 2 (2003) 70-98
5. Cardelli L., Ghelli G., and Gordon A.D. Mobility types for mobile ambients. Proc. of ICALP. LNCS volume 1644 (1999), Springer 230-239
6. Cardelli L., and Gordon A.D. Types for mobile ambients. Proc. of POPL (1999), ACM 79-92
7. Cardelli L., and Gordon A.D. Mobile ambients. Theoretical Computer Science 240 1 (2000) 177-213
8. De Nicola R., Gorla D., and Pugliese R. On the Expressive Power of KLAIM-based Calculi. Theoretical Computer Science 356 3 (2006) 387-421
9. De Nicola R., and Hennessy M. Testing equivalence for processes. Theoretical Computer Science 34 (1984) 83-133
10. D. Gorla. Comparing calculi for mobility via their relative expressive power. Technical Report 09/2006, Dip. di Informatica, Università di Roma "La Sapienza"
11. D. Gorla. On the relative expressive power of ambient-based calculi. To appear in the Proc. of TGC. Springer, 2008
12. Gorla D. On the relative expressive power of asynchronous communication primitives. Proc. of FoSSaCS. LNCS volume 3921 (2006), Springer 47-62
13. Gorla D. Towards a Unified Approach to Encodability and Separation Results for Process Calculi. Proc. of CONCUR'08 (2008), Springer 492-507 volume 5201
14. Hennessy M., and Riely J. Resource Access Control in Systems of Mobile Agents. Information and Computation 173 (2002) 82-120
15. Honda K., and Tokoro M. An object calculus for asynchronous communication. Proc. of ECOOP. LNCS volume 512 (1991), Springer 133-147
16. Levi F. A typed encoding of boxed into safe ambients. Acta Informatica 42 6 (2006) 429-500
17. Levi F., and Sangiorgi D. Mobile safe ambients. ACM Transactions on Programming Languages and Systems 25 1 (2003) 1-69
18. Maffeis S., and Phillips I. On the computational strength of pure ambient calculi. Theoretical Computer Science 330 3 (2005) 501-551
19. Milner R. Functions as processes. Journal of Mathematical Structures in Computer Science 2 2 (1992) 119-141
20. Nestmann U., and Pierce B.C. Decoding choice encodings. Information and Computation 163 (2000) 1-59
21. Palamidessi C. Comparing the expressive power of the synchronous and the asynchronous π-calculi. Mathematical Structures in Computer Science 13 5 (2003) 685-719
22. Phillips I., and Vigliotti M. Electoral systems in ambient calculi. Proc. of FoSSaCS. LNCS volume 2987 (2004), Springer 408-422
23. Phillips I., and Vigliotti M. Leader election in rings of ambient processes. Theoretical Computer Science 356 3 (2006) 468-494
24. Pierce B.C., and Turner D.N. Pict: A programming language based on the pi-calculus. Proof, Language and Interaction: Essays in Honour of Robin Milner (2000), MIT Press
25. Rathke J., Sassone V., and Sobocinski P. Semantic Barbs and Biorthogonality. Proc. of FoSSaCS. LNCS volume 4423 (2007), Springer 302-316
26. Zimmer P. On the Expressiveness of Pure Safe Ambients. Mathematical Structures in Computer Science 13 (2003) 721-770