Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Trustworthy Global Computing

TGC 2008: Trustworthy Global Computing pp 141–156Cite as

On the Relative Expressive Power of Ambient-Based Calculi

  • Conference paper

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

Abstract

Nowadays, some of the most successful models for global computers are defined as ambient-based calculi; among them, the mainstream models are Mobile, Safe and Boxed Ambients. In this paper, we comparatively analyze them and most of their variants by comparing every variant against the language it comes from. In particular, we discuss and compare: objective moves in Mobile Ambients; passwords and a different semantics for the out primitive in Safe Ambients; different communication and mobility primitives in Boxed Ambients. By establishing the possibility/impossibility of encoding one language in another one, we relate the three main models and, for each of their variant, we discover whether it enhances the original language or actually yields a different formalism.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bugliesi, M., Castagna, G., Crafa, S.: Access control for mobile agents: the calculus of Boxed Ambients. Trans. on Progr. Lang. and Syst. 26(1), 57–124 (2004)

    Article  Google Scholar 

  2. Bugliesi, M., Crafa, S., Merro, M., Sassone, V.: Communication and mobility control in Boxed Ambients. Information and Computation 202(1), 39–86 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cardelli, L., Ghelli, G., Gordon, A.D.: Types for the Ambient Calculus. Information and Computation 177(2), 160–194 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cardelli, L., Gordon, A.D.: Mobile ambients. Theoretical Computer Science 240(1), 177–213 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. De Nicola, R., Hennessy, M.: Testing equivalence for processes. Theoretical Computer Science 34, 83–133 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gorla, D.: Comparing calculi for mobility via their relative expressive power. Tech. Rep. 09/2006, Dip. di Informatica, Università di Roma La Sapienza

    Google Scholar 

  7. Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 492–507. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Kobayashi, N.: A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems 20(2), 436–482 (1998)

    Article  MathSciNet  Google Scholar 

  9. Levi, F.: A typed encoding of boxed into safe ambients. Acta Informatica 42(6), 429–500 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Levi, F., Sangiorgi, D.: Mobile safe ambients. ACM Transactions on Programming Languages and Systems 25(1), 1–69 (2003)

    Article  Google Scholar 

  11. Merro, M., Hennessy, M.: A bisimulation-based semantic theory of Safe Ambients. ACM Trans. on Programming Languages and Systems 28(2), 290–330 (2006)

    Article  Google Scholar 

  12. Merro, M., Sassone, V.: Typing and subtyping mobility in boxed ambients. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 304–320. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  14. Palamidessi, C.: Comparing the expressive power of the synchronous and the asynchronous π-calculi. Mathem. Structures in Computer Science 13(5), 685–719 (2003)

    Article  MathSciNet  Google Scholar 

  15. Phillips, I., Vigliotti, M.: On reduction semantics for the push and pull ambient calculus. In: IFIP Conf. on Theoretical Comp. Sci., pp. 550–562. Kluwer, Dordrecht (2002)

    Google Scholar 

  16. Phillips, I., Vigliotti, M.: Electoral systems in ambient calculi. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 408–422. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Phillips, I., Vigliotti, M.: Leader election in rings of ambient processes. Theoretical Computer Science 356(3), 468–494 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  18. Rathke, J., Sassone, V., Sobocinski, P.: Semantic barbs and biorthogonality. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 302–316. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Informatica, Univ. di Roma “La Sapienza”, Italy

    Daniele Gorla

Authors
  1. Daniele Gorla
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Engineering and Informatics, University of Patras and RA CTI, 26500, Rion, Greece

    Christos Kaklamanis

  2. Department of Informatics and Mathematical Modelling, Richard Pedersens Plads, Technical University of Denmark, 2800, Kongens Lyngby, Denmark

    Flemming Nielson

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gorla, D. (2009). On the Relative Expressive Power of Ambient-Based Calculi. In: Kaklamanis, C., Nielson, F. (eds) Trustworthy Global Computing. TGC 2008. Lecture Notes in Computer Science, vol 5474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00945-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00945-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00944-0

  • Online ISBN: 978-3-642-00945-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation