Skip to main content

Encoding Mobile Ambients into the π-Calculus

  • Conference paper
Perspectives of Systems Informatics (PSI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4378))

Abstract

We present an encoding of the mobile ambients without communication into a subset of the π-calculus, namely the localized sum-free synchronous π-calculus. We prove the operational correspondence between the two formalisms. A key idea of the encoding is the separation of the spatial structure of mobile ambients from their operational semantics. The operational semantics is given by a universal π-process Ruler which communicates with a π-calculus term Structure A simulating the spatial structure of a mobile ambient A by means of channels. We consider the presented encoding as a first step toward designing a fully abstract translation of the calculus of mobile ambients into the π-calculus and thus developing a uniform framework for the theory of mobile computations.

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

Access this chapter

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. Brodo, L., Degano, P., Priami, C.: Reflecting mobile ambients into the π-calculus. In: Priami, C. (ed.) GC 2003. LNCS, vol. 2874, pp. 25–56. Springer, Heidelberg (2003)

    Google Scholar 

  2. Cardelli, L., Gordon, A.: Mobile Ambients. Theoretical Computer Science 240(1), 177–213 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Charatonik, W., Gordon, A., Talbot, J.-M.: Finite-control mobile ambients. In: Le Métayer, D. (ed.) ESOP 2002 and ETAPS 2002. LNCS, vol. 2305, pp. 295–313. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Ciobanu, G., Zakharov, V.A.: Embedding mobile ambients into the π-calculus. ”A.I.Cuza” University of Iasi, Faculty of Computer Science, Technical Report TR 05-07. Available from http://thor.info.uaic.ro/~tr/tr05-07.pdf

  5. Dal-Zilio, S.: Mobile processes: a commented bibliography. In: Cassez, F., et al. (eds.) MOVEP 2000. LNCS, vol. 2067, pp. 206–222. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Ferrari, G., et al.: Verifying mobile processes in the HAL environment. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 511–515. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join-calculus. In: Proceedings of POPL’96, pp. 372–385. ACM Press, New York (1996)

    Google Scholar 

  8. Fournet, C., et al.: A calculus of mobile agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 406–421. Springer, Heidelberg (1996)

    Google Scholar 

  9. Fournet, C., Levy, J.J., Schmitt, A.: An Asynchronous Distributed Implementation of Mobile Ambients. In: Watanabe, O., et al. (eds.) TCS 2000. LNCS, vol. 1872, pp. 348–364. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  11. Levi, F., Sangiorgi, D.: Controlling inference in ambients. In: POPL’00, pp. 372–385. ACM Press, New York (2000)

    Google Scholar 

  12. Levi, F., Maffeis, S.: An abstract interpretation framework for mobile ambients. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 395–411. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Merro, M., Nardelli, Z.: Behavioral theory for mobile ambients. Journal of the ACM 52(6), 961–1023 (2005)

    Article  MathSciNet  Google Scholar 

  14. Milner, R.: Communicating and mobile systems: the π-calculus. Cambridge University Press, Cambridge (1999)

    Google Scholar 

  15. Pierce, B.C., Turner, D.N.: Pict: a programming language based on the pi-calculus. In: Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press, Cambridge (1997)

    Google Scholar 

  16. Sangiorgi, D., Walker, D.: The π-calculus: a theory of mobile processes. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  17. Sangiorgi, D., Walker, D.: On barbed equivalence in π-calculus. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 292–304. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Victor, B., Moller, F.: The Mobility Workbench – a tool for the π- calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 428–440. Springer, Heidelberg (1994)

    Google Scholar 

  19. Zimmer, P.: On the expressiveness of pure safe ambients. Mathematical Structures in Computer Science 13(5), 721–770 (2003)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Irina Virbitskaite Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciobanu, G., Zakharov, V.A. (2007). Encoding Mobile Ambients into the π-Calculus. In: Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2006. Lecture Notes in Computer Science, vol 4378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70881-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70881-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70880-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics