Skip to main content
SpringerLink
Log in

How faithfully can π be interpreted in SA?

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

The π calculus and the safe ambient calculus are two of the widely studied variants of process calculi in the field of concurrency theory. The former is the most classic model for mobile processes and the latter is well known for its nested structure. However, the relationship between these two models deserves further investigation. In this paper, we reinvestigate this problem thoroughly. We first give the strengthened encoding criteria. Then we propose the encoding of the synchronous π-calculus into the safe ambients calculus. The encoding scheme is a generalization and improvement of Levi and Sangiorgi’s work when moving from the asynchronous π-calculus to the synchronous π-calculus. We show the merits of the encoding by checking the mentioned criteria.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Milner R, Parrow J, Walker D, et al. A calculus of mobile processes, part i, ii. Inf Comput, 1992, 100: 1–77

    Article  MathSciNet  MATH  Google Scholar 

  2. Cardelli L, Gordon A D. Mobile ambients. Theor Comput Sci, 2000, 240: 177–213

    Article  MathSciNet  MATH  Google Scholar 

  3. Levi F, Sangiorgi D. Mobile safe ambients. ACM Trans Program Lang Syst, 2003, 25: 1–69

    Article  Google Scholar 

  4. Boudol G. Asynchrony and the pi-calculus. Technical report INRIA Sophia-Antipolis. 1992

  5. Gorla D. Comparing calculi for mobility via their relative expressive power. Technical report Dip. di Informatica, Univ. di Roma “a Sapienza” (Italy). 2008

  6. Gorla D. On the relative expressive power of calculi for mobility. In: Proceedings of the 25th Intern. Conf. on Mathematical Foundations of Programming Semantics (MFPS XXV). ENTCS: Elsevier, 2009

  7. Zimmer P. On the expressiveness of pure mobile ambients. In: Aceto L, Victor B, eds. Proceedings of the 7th International Workshop on Expressiveness in Concurrency (EXPRESS’00), Electronic Notes in Theoretical Computer Science, 2003. 94–117

  8. Zimmer P. On the expressiveness of pure safe ambients. Math Struct Comput Sci, 2003, 13: 721–770

    Article  MathSciNet  Google Scholar 

  9. Milner R, Sangiorgi D. Barbed bisimulation. In: Proceedings of ICALP. Berlin: Springer, 1992. 685–695

    Google Scholar 

  10. Gorla D. Towards a unified approach to encodability and separation results in process calculi. In: van Breugel F, ed. Proceedings Concur 2008-Concurrency Theory. Toronto: Springer, 2008. LNCS 5201. 492–507

    Chapter  Google Scholar 

  11. Palamidessi C. Comparing the expressive power of the synchronous and asynchronous pi-calculi. Math Struct Comput Sci, 2003, 13: 685–719

    Article  MathSciNet  Google Scholar 

  12. Palamidessi C. Comparing the expressive power of the synchronous and the asynchronous pi-calculus. In: Lee P, Henglein F, Jones N D, eds. Conference Record of POPL’97POPL, 1997. 256–265

  13. Gorla D. On the relative expressive power of asynchronous communication primitives. In: Proceedings of the 25th Intern. Conf. on Mathematical Foundations of Programming Semantics (MFPS XXV). ENTCS: Elsevier, 2009

    Google Scholar 

  14. Gorla D. Comparing communication primitives via their relative expressive power. Inf Comput, 2008, 206: 931–952

    Article  MathSciNet  MATH  Google Scholar 

  15. Nestmann U, Pierce B. Decoding choice encodings. In: Montanari U, ed. Proc. of the 7th International Conference on Concurrency Theory. Berlin: Springer, 1996. 179–194

    Google Scholar 

  16. Gorla D. Towards a unified approach to encodability and separation results for process calculi. Inf Comput, 2010, 208: 1031–1053

    Article  MathSciNet  MATH  Google Scholar 

  17. Sangiorgi D. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Dissertation for the Doctoral Degree. Edinburgh: University of Edinburgh, 1992

    Google Scholar 

  18. Boreale M, Sangiorgi D. Bisimulation in name-passing calculi without matching. In: Proc of 13th Symposium on Logic in Computer Science, Indianapolis, 1998. 165–175

  19. Fu Y, Han Z. The Name-Passing Calculus. 2011. Available from: http://basics.sjtu.edu.cn/yuxi/papers/npc.pdf

  20. Merro M, Hennessy M. A bisimulation-based semantic theory of safe ambients. ACM Trans Program Lang Syst, 2006, 28: 290–330

    Article  Google Scholar 

  21. Fu Y. Fair ambients. Acta Inf, 2007, 43: 535–594

    Article  MATH  Google Scholar 

  22. Merro M, Nardelli F Z. Behavioral theory for mobile ambients. J ACM, 2005, 52: 961–1023

    Article  MathSciNet  Google Scholar 

  23. Vigliotti M G. Reduction semantics for ambient calculi. Dissertation for the Doctoral Degree. London: University of London, 2004

    Google Scholar 

  24. Fu Y, Lu H. On the expressiveness of interaction. Theor Comput Sci, 2010, 411: 1387–1451

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Basic Studies in Computing Science, Department of Computer Science, MOE-MS Key Laboratory for Intelligent Computing and Intelligent Systems, Shanghai Jiao Tong University, Shanghai, 200240, China

    Huan Long & YuXi Fu

Authors
  1. Huan Long
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. YuXi Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Huan Long or YuXi Fu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Long, H., Fu, Y. How faithfully can π be interpreted in SA?. Sci. China Inf. Sci. 56, 1–15 (2013). https://doi.org/10.1007/s11432-012-4663-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-012-4663-y

Keywords

Search

Navigation