Skip to main content
SpringerLink
Log in

Bisimulation Proof Methods for Mobile Ambients

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2719))

Included in the following conference series:

Abstract

We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an LTS based operational semantics, and a labelled bisimulation based equivalence that coincides with reduction barbed congruence. We also provide up-to proof techniques and prove a set of algebraic laws, including the perfect firewall equation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science, 195:291–324, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Bugliesi, S. Crafa, M. Merro, and V. Sassone. Communication interference in mobile boxed ambients. Forthcoming Technical Report. An extended abstract appeared in Proc. FSTTCS’02, LNCS, Springer-Verlag.

    Google Scholar 

  3. L. Cardelli and A. Gordon. A commitment relation for the ambient calculus. Unpublished notes, 1996.

    Google Scholar 

  4. L. Cardelli and A. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177–213, 2000. An extended abstract appeared in Proc. of FoSSaCS’ 98.

    Article  MATH  MathSciNet  Google Scholar 

  5. G. Castagna and F. Zappa Nardelli. The seal calculus revisited: Contextual equivalence and bisimilarity. In Proc. 22ndFSTTCS’ 02, volume 2556 of LNCS. Springer-Verlag, 2002.

    Google Scholar 

  6. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  7. G. Ferrari, U. Montanari, and E. Tuosto. A LTS semantics of ambients via graph synchronization with mobility. In Proc. ICTCS, volume 2202 of LNCS, 2001.

    Google Scholar 

  8. C. Fournet and G. Gonthier. A hierarchy of equivalences for asynchronous calculi. In Proc. 25th ICALP, pages 844–855, 1998.

    Google Scholar 

  9. J.C. Godskesen, T. Hildebrandt, and V. Sassone. A calculus of mobile resources. In Proc. 10th CONCUR’ 02, volume 2421 of LNCS, 2002.

    Google Scholar 

  10. A. D. Gordon and L. Cardelli. Equational properties of mobile ambients. Journal of Mathematical Structures in Computer Science, 12:1–38, 2002.

    Article  Google Scholar 

  11. M. Hennessy and J. Riely. A typed language for distributed mobile processes. In Proc. 25th POPL. ACM Press, 1998.

    Google Scholar 

  12. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437–486, 1995.

    Article  MathSciNet  Google Scholar 

  13. F. Levi and D. Sangiorgi. Controlling interference in ambients. In Proc. 27th POPL. ACM Press, 2000.

    Google Scholar 

  14. M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. In Proc. 29th POPL’ 02. ACM Press, 2002.

    Google Scholar 

  15. M. Merro and F. Zappa Nardelli. Bisimulation proof methods for mobile ambients. Computer Science Report 2003:01, http://cogslib.cogs.susx.ac.uk/csr_abs.php?cs, University of Sussex, 2003.

    Google Scholar 

  16. M. Hennessy M. Merro and J. Rathke. Towards a behavioural theory of access and mobility control in distributed system. To appear in Proc. 5th FoSSaCS’ 03, LNCS, 2003, Springer-Verlag.

    Google Scholar 

  17. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1–77, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  18. R. Milner and D. Sangiorgi. Barbed bisimulation. In Proc. 19th ICALP, volume 623 of LNCS, pages 685–695. Springer Verlag, 1992.

    Google Scholar 

  19. D.M. Park. Concurrency on automata and infinite sequences. In P. Deussen, editor, Conf. on Theoretical Computer Science, volume 104 of LNCS. Springer Verlag, 1981.

    Google Scholar 

  20. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992.

    Google Scholar 

  21. D. Sangiorgi. Bisimulation for Higher-Order Process Calculi. Information and Computation, 131(2):141–178, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  22. D. Sangiorgi. On the bisimulation proof method. Journal of Mathematical Structures in Computer Science, 8:447–479, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  23. D. Sangiorgi. Extensionality and intensionality of the ambient logic. In Proc. 28th POPL. ACM Press, 2001.

    Google Scholar 

  24. D. Sangiorgi and R. Milner. The problem of “Weak Bisimulation up to”. In Proc. CONCUR’ 92, volume 630 of LNCS, pages 32–46. Springer Verlag, 1992.

    Chapter  Google Scholar 

  25. D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.

    Google Scholar 

  26. A. Unyapoth and P. Sewell. Nomadic Pict: Correct communication infrastructures for mobile computation. In Proc. 28th POPL. ACM, January 2001.

    Google Scholar 

  27. 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 

  28. J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Università di Verona, Italy

    Massimo Merro

  2. LIENS, Paris, France

    Francesco Zappa Nardelli

Authors
  1. Massimo Merro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesco Zappa Nardelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA, 30332-0205, USA

    Jan Karel Lenstra

  3. Department of Information Technology, Uppsala University, P.O. Box 337, 75105, Uppsala, Sweden

    Joachim Parrow

  4. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Merro, M., Nardelli, F.Z. (2003). Bisimulation Proof Methods for Mobile Ambients. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-45061-0_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40493-4

  • Online ISBN: 978-3-540-45061-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation