Behavioral theory for Mobile Ambients

Journal of the ACM

Volumn 52, Issue 6, 2005, Pages 961-1023

  Merro, Massimo ^a   Zappa Nardelli, Francesco ^b  

^a UNIVERSITY OF VERONA   (Italy)

^b INRIA ROCQUENCOURT   (France)

Author keywords

Behavioral theories; Bisimulation; Concurrency; Process calculi; Programming languages

Indexed keywords

LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; SOFTWARE AGENTS; WIDE AREA NETWORKS;

BEHAVIORAL THEORIES; BISIMULATION; CONCURRENCY; PROCESS CALCULI;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 33646146147     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1101821.1101825     Document Type: Article

References (45)

1. AMADIO, R., CASTELLANI, I., AND SANGIORGI, D. 1998. On bisimulations for the asynchronous π-calculus. Theoret. Comput. Sci. 195, 291-324.
2. ARUN-KUMAR, S., AND HENNESSY, M. 1992. An efficiency preorder for processes. Acta Inf. 29, 737-760.
3. BOUDOL, G. 1992. Asynchrony and the π -calculus. Tech. Rep. RR-1702, INRIA-Sophia Antipolis.
4. BUGLIESI, M., CRAFA, S., MERRO, M., AND SASSONE, V. 2005. Communication and mobility control in boxed ambients. Information and Computation. 202, 1, 39-86.
5. CARDELLI, L. 1999. Wide area computation. Lecture Notes in Computer Science 1644, 10-24.
6. CARDELLI, L., AND GORDON, A. 1996. A commitment relation for the ambient calculus. Unpublished notes.
7. CARDELLI, L., AND GORDON, A. 2000. Mobile ambients. Theoret. Comput. Sci. 240, 1, 177-213.
8. CASTAGNA, G., VITEK, J., AND ZAPPA NARDELLI, F. 2005. The seal calculus. Inf. Comput. 201, 1, 1-54.
9. DE NICOLA, R., AND HENNESSY, M. 1984. Testing equivalences for processes. Theoret. Comput. Sci. 34, 83-133.
10. FERRARI, G., MONTANARI, U., AND TUOSTO, E. 2001. A LTS semantics of ambients via graph synchronization with mobility. In Proceedings of ICTCS. Lecture Notes in Computer Science, vol. 2202. Springer-Verlag, New York.
11. FOURNET, C., AND GONTHIER, G. 1998. A hierarchy of equivalences for asynchronous calculi. In Proceedings of 25th ICALP. Lecture Notes in Computer Science, vol. 1443. Springer-Verlag, New York, 844-855.
12. GODSKESEN, J., HILDEBRANDT, T., AND SASSONE, V. 2002. A calculus of mobile resources. In Proceedings of 10th CONCUR '02. Lecture Notes in Computer Science, vol. 2421. Springer-Verlag, New York.
13. GORDON, A. D., AND CARDELLI, L. 2002. Equational properties of mobile ambients. J. Math. Struct. Comput. Sci. 12, 1-38.
14. HENNESSY, M., MERRO, M., AND RATHKE, J. 2004. Towards a behavioral theory of access and mobility control in distributed systems. Theoret. Comput. Sci. 322, 615-669.
15. HENNESSY, M., RATHKE, J., AND YOSHIDA, N. 2003. Safedpi: A language for controlling mobile code. Computer Science Report 2003:02, University of Sussex.
16. HENNESSY, M., AND RIELY, J. 1998. A typed language for distributed mobile processes. In Proc. of 25th POPL ACM, New York.
17. HILDEBRANDT, T., GODSKESEN, J. C., AND BUNDGAARD, M. 2004. Bisimulation congruences for homer. Tech. Rep. TR-2004-52, ITU.
18. HIRSCHKOFF, D., LOZES, E., AND SANGIORGI, D. 2002. Separability, expressiveness, and decidability in the ambient logic. In Proceedings of LICS. IEEE Computer Society Press, Los Alamitos, CA, 423-432.
19. HONDA, K., AND TOKORO, M. 1991. An object calculus for asynchronous communications. In Proceedings of ECOOP '91. Lecture Notes in Computer Science, vol. 512. Springer Verlag, New York.
20. HONDA, K., AND YOSHIDA, N. 1995. On reduction-based process semantics. Theoret. Comput. Sci. 152, 2, 437-486.
21. HOWE, D. J. 1996. Proving congruence of bisimulation in functional programming languages. Inf. Comput. 124, 2, 103-112.
22. JEFFREY, A., AND RATHKE, J. 2005. Contextual equivalence for higher-order π-calculus revisited. Log. Meth. Comput. Sci. 1, 1-4.
23. JENSEN, O. H., AND MILNER, R. 2004. Bigraphs and mobile processes (revised). Tech. Rep. 580, LFCS, Dept. of Comp. Sci., Edinburgh Univ. Feb. (An extended abstract appeared in Conference Record of 30th Symposium on Principles of Programming Languages (POPL). ACM, New York, 2003.)
24. LEIFER, J. J., AND MILNER, R. 2000. Deriving bisimulation congruences for reactive systems. In Proceedings of CONCUR 2000. Lecture Notes in Computer Science, vol. 1877. Springer-Verlag, New York, 243-258.
25. LEVI, F., AND SANGIORGI, D. 2000. Controlling interference in ambients. In Proceedings of 27th POPL. ACM, New York.
26. LEVI, F., AND SANGIORGI, D. 2003. Mobile safe ambients. ACM Trans. Prog. Lang. Syst. 25, 1 (Jan.), 1-69.
27. MERRO, M., AND HENNESSY, M. 2002. Bisimulation congruences in safe ambients. In Proceedings of the 29th POPL '02. ACM, New York.
28. MERRO, M., AND HENNESSY, M. 2005. A bisimulation-based semantic theory for safe ambients. ACM Trans. Prog. Lang. Syst. in press.
29. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall, Englewood Cliffs. N.J.
30. MILNER, R., PARROW, J., AND WALKER, D. 1992. A calculus of mobile processes, (Parts I and II). Inf. Comput. 100, 1-77.
31. MILNER, R., AND SANGIORGI, D. 1992. Barbed bisimulation. In Proceedings of the 19th ICALP. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, 685-695.
32. PARK, D. 1981. Concurrency on automata and infinite sequences. In Conference on Theoretical Computer Science, P. Deussen, Ed. Lecture Notes in Computer Science, vol. 104. Springer-Verlag, New York.
33. SANGIORGI, D. 1992. Expressing mobility in process algebras: First-order and higher-order paradigms. Ph.D. thesis, Dept. of Comp. Sci., Edinburgh University.
34. SANGIORGI, D. 1996a. Bisimulation for higher-order process calculi. Inf. Comput. 131, 2, 141-178.
35. SANGIORGI, D. 1996b. Locality and non-interleaving semantics in calculi for mobile processes. Theoret. Comput. Sci. 155, 39-83.
36. SANGIORGI, D. 1998. On the bisimulation proof method. J. Math. Struct. Comput. Sci. 8, 447-479.
37. SANGIORGI, D. 2001. Extensionality and intensionality of the ambient logic. In Proceedings of the 28th POPL. ACM, New York.
38. SANGIORGI, D., AND MILNER, R. 1992. The problem of "Weak Bisimulation up to". In Proceedings of CONCUR '92. Lecture Notes in Computer Science, vol. 630. Springer Verlag, 32-46.
39. SANGIORGI, D., AND WALKER, D. 2001a. The π-calculus: a Theory of Mobile Processes. Cambridge University Press.
40. SANGIORGI, D., AND WALKER, D. 2001b. Some results on barbed equivalences in pi-calculus. In Proceedings of CONCUR '01. Lecture Notes in Computer Science, vol. 2154. Springer-Verlag, New York.
41. SCHMITT, A., AND STEFANI, J. 2004. The kell calculus: A family of higher-order distributed process calculi. In Lecture Notes in Computer Science, Springer-Verlag. Workshop of Global Computing.
42. SEWELL, P. 2002. From rewrite rules to bisimulation congruences. Theoret. Comput. Sci. 274, 1-2, 183-230.
43. UNYAPOTH, A., AND SEWELL, P. 2001. Nomadic pict: Correct communication infrastructures for mobile computation. In Proceedings of the 28th POPL. ACM, New York.
44. VIGLIOTTI, M. G. 1999. Transition systems for the ambient calculus. Master thesis, Imperial College of Science, Technology and Medicine (University of London).
45. VITEK, J., AND CASTAGNA, G. 1999. Seal: A framework for secure mobile computations. In Internet Programming Languages. Lecture Notes in Computer Science, vol. 1686. Springer Verlag, New York, 47-77.