Behavioural Theory for Mobile Ambients

  • Massimo Merro
  • Francesco Zappa Nardelli
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 155)


We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients, by focusing on a standard contextual equivalence, reduction barbed congruence. We prove a context lemma that allows the derivation of contextual equivalences by considering only contexts for concurrency and locality. We go further and give a characterisation of reduction barbed congruence over arbitrary processes in terms of a labelled bisimilarity defined over a restricted class of processes, called systems. This characterisation extends and completes an earlier result on bisimulation proofmethods for Mobile Ambients, that was restricted to systems. The characterisation is then used to prove a collection of algebraic laws.


Parallel Composition Behavioural Theory Label Transition System Matching Transition System Context 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science, 195:291–324, 1998.CrossRefMathSciNetGoogle Scholar
  2. [2]
    S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. Acta Informatica, 29:737–760, 1992.CrossRefMathSciNetGoogle Scholar
  3. [3]
    M. Bugliesi, S. Crafa, M. Merro. V. Sassone. Communication interference in mobile boxed ambients. To appear in Information & Computation 2004, an extended abstract appeared in Proc. FSTTCS’02, LNCS, Springer Verlag.Google Scholar
  4. [4]
    L. Cardelli and A. Gordon. A commitment relation for the ambient calculus. 1996.Google Scholar
  5. [5]
    L. Cardelli and A. Gordon. Mobile ambients. Theoretical Computer Science, 240(1): 177–213, 2000. An extended abstract appeared in Proc. of FoSSaCS’ 98.CrossRefMathSciNetGoogle Scholar
  6. [6]
    G. Castagna and F. Zappa Nardelli. The seal calculus revisited: Contextual equivalence and bisimilarity. In Proc. 22nd FSTTCS’02, LNCS. Springer Verlag, 2002.Google Scholar
  7. [7]
    G. Ferrari, U. Montanari, and E. Tuosto. A LTS semantics of ambients via graph synchro nization with mobility. In Proc. ICTCS, LNCS, 2001.Google Scholar
  8. [8]
    J.C. Godskesen, T. Hildebrandt, and V. Sassone. A calculus of mobile resources. In Proc. 10th CONCUR’ 02, LNCS, 2002.Google Scholar
  9. [9]
    A. D. Gordon and L. Cardelli. Equational properties of mobile ambients. Journal of Mathematical Structures in CS, 12:1–38, 2002. Also in Proc. FoSSaCs’ 99.Google Scholar
  10. [10]
    M. Hennessy, M. Merro, and J. Rathke. Towards a behavioural theory of access and mobility control in distributed system. In Proc. 5th FoSSaCS’03, LNCS, 2003.Google Scholar
  11. [11]
    M. Hennessy, J. Rathke, and N. Yoshida. safedpi: a language for controlling mobile code. In Proc. FOSSACS 03, LNCS, 2003.Google Scholar
  12. [12]
    M. Hennessy and J. Riely. A typed language for distributed mobile processes. In Proc. 25th POPL. ACM Press, 1998.Google Scholar
  13. [13]
    K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437–486, 1995.MathSciNetGoogle Scholar
  14. [14]
    F. Levi and D. Sangiorgi. Controlling interference in ambients. An extended abstract appeared in Proc. 27th POPL, ACM Press, 2000.Google Scholar
  15. [15]
    M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. In Proc. 29th POPL, ACM Press, 2002.Google Scholar
  16. [16]
    M. Merro and F. Zappa Nardelli. Bisimulation proof methods for mobile ambients. In Proc. ICALP 2003, LNCS, Springer Verlag, 2003. An extended version is available as Computer Science Report 2003: 01, University of Sussex.Google Scholar
  17. [17]
    R. Milner, J. Parrow, D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100: 1–77, 1992.MathSciNetGoogle Scholar
  18. [18]
    D. Sangiorgi. Extensionality and intensionality of the ambient logic. In Proc. 28th POPL, ACM Press, 2001.Google Scholar
  19. [19]
    A. Unyapoth and P. Sewell. Nomadic Pict: Correct communication infrastructures for mobile computation. In Proc. 28th POPL. ACM Press, 2001.Google Scholar
  20. [20]
    M. G. Vigliotti. Transition systems for the ambient calculus. Master thesis, Imperial College of Science, Technology and Medicine (University of London), September 1999.Google Scholar
  21. [21]
    J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, LNCS, Pages 47–77, Springer Verlag, 1999.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2004

Authors and Affiliations

  • Massimo Merro
    • 1
  • Francesco Zappa Nardelli
    • 2
  1. 1.Dipartimento di InformaticaUniversità di VeronaItaly
  2. 2.INRIA & Computer LaboratoryUniversity of CambridgeUK

Personalised recommendations