On the computational strength of pure ambient calculi

Theoretical Computer Science

Volumn 330, Issue 3, 2005, Pages 501-551

  Maffeis, Sergio ^a   Phillips, Iain ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Ambient calculus; Counter machine; Decidability; Termination; Turing completeness

Indexed keywords

COMMUNICATION; COMPUTATIONAL METHODS; DECISION THEORY; ENCODING (SYMBOLS); TURING MACHINES;

AMBIENT CALCULUS; COUNTER MACHINES; TERMINATION; TURING COMPLETENESS;

MOBILE COMPUTING;

EID: 12444283739     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.007     Document Type: Conference Paper

References (29)

1. J. Bergstra, and J.-W. Klop Process algebra for synchronous communication Information and Control 60 1984 109 137
2. I. Boneva, J.-M. Talbot, When ambients cannot be opened, in: Proc. FoSSaCS 2003, Lecture Notes in Computer Science, Vol. 2620, Springer, Berlin, 2003, pp. 169-184, full version to appear in Theoret. Comput. Sci.
3. M. Bugliesi, G. Castagna, and S. Crafa Access control for mobile agents the calculus of Boxed Ambients ACM Trans. Program. Languages Systems 26 1 2004 57 124
4. M. Bugliesi, S. Crafa, M. Merro, V. Sassone, Communication and mobility control in boxed ambients, Inform. Comput., to appear.
5. M. Bugliesi, S. Crafa, M. Merro, V. Sassone, Communication interference in mobile boxed ambients, in: Proc. FSTTCS'02, Lecture Notes in Computer Science, Vol. 2556, Springer, Berlin, 2002, pp. 71-84 (full version appears as M. Bugliesi, S. Crafa, M. Merro, V. Sassone, Communication and mobility control in boxed ambients, Inform. Comput., to appear).
6. M. Bugliesi, S. Crafa, M. Merro, V. Sassone, Communication interference in mobile boxed ambients, in: Proc. FSTTCS'02, Lecture Notes in Computer Science, Vol. 2556, Springer, Berlin, 2002, pp. 71-84 (full version appears as M. Bugliesi, S. Crafa, M. Merro, V. Sassone, Communication and mobility control in boxed ambients, Inform. Comput., to appear).
7. N. Busi, M. Gabbrielli, G. Zavattaro, Replication vs. recursive definitions in channel based calculi, in: Proc. ICALP'03, Lecture Notes in Computer Science, Vol. 2719, Springer, Berlin, 2003, pp. 133-144.
8. N. Busi, M. Gabbrielli, G. Zavattaro, Comparing recursion, replication, and iteration in process calculi, in: Proc. ICALP'04, Lecture Notes in Computer Science, Springer, Berlin, 2004, to appear.
9. N. Busi, and G. Zavattaro On the expressive power of movement and restriction in pure mobile ambients Theoret. Comput. Sci. 322 2004 477 515
10. L. Cardelli, and A. Gordon Mobile ambients Theoret. Comput. Sci. 240 1 2000 177 213
11. S. Crafa, M. Bugliesi, G. Castagna, Information flow security for boxed ambients, in: Proc. F-WAN: Workshop on Foundations of Wide Area Network Computing, Malaga, July 2002, Electronic Notes in Theoretical Computer Science, Vol. 66, Elsevier, Amsterdam, 2002.
12. N. Dershowitz, and Z. Manna Proving termination with multiset orderings Commun. ACM. 22 8 1979 465 476
13. A. Finkel, and P. Schnoebelen Well-structured transition systems everywhere! Theoret. Comput. Sci. 256 2001 63 92
14. L. Guan, Y. Yang, J. You, Making ambients more robust, in: Proc. Internat. Conf. on Software: Theory and Practice, Beijing, China, August 2000, 2000, pp. 377-384.
15. D. Hirschkoff, E. Lozes, D. Sangiorgi, Separability, expressiveness, and decidability in the ambient logic, in: Proc. LICS 2002, Lecture Notes in Computer Science, IEEE Computer Society Press, Silver Spring, MD, 2002, pp. 423-432.
16. F. Levi, and D. Sangiorgi Mobile safe ambients ACM Trans. Program. Languages Systems 25 1 2003 1 69
17. S. Maffeis, I. Phillips, On the computational strength of pure ambient calculi, in: Proc. Express 2003, Marseille, September 2003, Electronic Notes in Theoretical Computer Science, Vol. 96, Elsevier, Amsterdam, 2004, pp. 29-49.
18. M. Merro, M. Hennessy, Bisimulation congruences in safe ambients, in: Proc. 29th Ann. Symp. on Principles of Programming Languages, POPL'02, ACM, New York, 2002, pp. 71-80.
19. M. Merro, V. Sassone, Typing and subtyping mobility in boxed ambients, in: Proc. CONCUR'02, Lecture Notes in Computer Science, Vol. 2421, Springer, Berlin, 2002, pp. 304-320.
20. R. Milner Communication and Concurrency 1989 Prentice-Hall Englewood Cliffs, NJ
21. M. Minsky Computation Finite and Infinite Machines 1967 Prentice-Hall Englewood Cliffs, NJ
22. I. Phillips, M. Vigliotti, On reduction semantics for the push and pull ambient calculus, in: Proc. TCS 2003, IFIP 17th World Computer Congress, August 2002, Montreal, Kluwer, Dordrecht, 2002, pp. 550-562.
23. I. Phillips, M. Vigliotti, Electoral systems in ambient calculi, in: Proc. FoSSaCS 2004, Lecture Notes in Computer Science, Vol. 2987, Springer, Berlin, 2004, pp. 408-422.
24. A. Phillips, N. Yoshida, S. Eisenbach, A distributed abstract machine for boxed ambient calculi, in: Proc. ESOP'04, Lecture Notes in Computer Science, Vol. 2986, Springer, Berlin, 2004, pp. 155-170.
25. D. Sangiorgi, Extensionality and intensionality of the ambient logics, in: Proc. POPL'01, ACM, 2001, pp. 4-17.
26. D. Sangiorgi, and D. Walker The π -calculus 2001 Cambridge University Press Cambridge
27. J. Shepherdson, and J. Sturgis Computability of recursive functions J. ACM. 10 1963 217 255
28. D. Teller, P. Zimmer, D. Hirschkoff, Using ambients to control resources, in: Proc. CONCUR 2002, Lecture Notes in Computer Science, Vol. 2421, Springer, Berlin, 2002, pp. 288-303, full version to appear in Internat. J. Inform. Security.
29. P. Zimmer On the expressiveness of pure safe ambients Math. Struct. Comput. Sci. 13 5 2003 721 770