Remark on Some \(\pi \) Variants

Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10606)

Abstract

Two \(\pi \) variants that restrict the use of received names are studied. For either variant the external characterization of the absolute equality is given using a family of bisimulations; the expressive completeness of the calculus is established; and a complete equational proof system is constructed. The relative expressiveness between the two variants and their relationship to \(\pi \) are revealed in terms of subbisimilarity.

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

Notes

Acknowledgments

This work has been supported by National Natural Science Foundation of China (61502296, 61472239, 61261130589) and Natural Science Foundation of Shanghai (15ZR1417000).

References

  1. [ACS96]
    Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous \(\pi \)-calculus. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 147–162. Springer, Heidelberg (1996). doi: 10.1007/3-540-61604-7_53 Google Scholar
  2. [Bae96]
    Baeten, J.: Branching bisimilarity is an equivalence indeed. Inform. Process. Lett. 58, 141–147 (1996)MathSciNetCrossRefMATHGoogle Scholar
  3. [BGZ03]
    Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. recursive definitions in channel based calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 133–144. Springer, Heidelberg (2003). doi: 10.1007/3-540-45061-0_12 CrossRefGoogle Scholar
  4. [BGZ04]
    Busi, N., Gabbrielli, M., Zavattaro, G.: Comparing recursion, replication, and iteration in process calculi. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 307–319. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-27836-8_28 CrossRefGoogle Scholar
  5. [Bou92]
    Boudol, G.: Asynchrony and the \(\pi \)-calculus. Technical report RR-1702, INRIA Sophia-Antipolis (1992)Google Scholar
  6. [CF11]
    Cai, X., Fu, Y.: The \(\lambda \)-calculus in the \(\pi \)-calculus. Math. Struct. Comput. Sci. 21, 943–996 (2011)MathSciNetCrossRefMATHGoogle Scholar
  7. [DNMV90]
    Nicola, R., Montanari, U., Vaandrager, F.: Back and forth bisimulations. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 152–165. Springer, Heidelberg (1990). doi: 10.1007/BFb0039058 CrossRefGoogle Scholar
  8. [FL10]
    Fu, Y., Lu, H.: On the expressiveness of interaction. Theoret. Comput. Sci. 411, 1387–1451 (2010)MathSciNetCrossRefMATHGoogle Scholar
  9. [Fu]
    Fu, Y.: The universal process. In: Logical Methods in Computer Science (to appear)Google Scholar
  10. [Fu05]
    Fu, Y.: On quasi open bisimulation. Theoret. Comput. Sci. 338, 96–126 (2005)MathSciNetCrossRefMATHGoogle Scholar
  11. [Fu10]
    Fu, Y.: Theory by process. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 403–416. Springer, Heidelberg (2010). doi: 10.1007/978-3-642-15375-4_28 CrossRefGoogle Scholar
  12. [Fu13]
    Fu, Y.: The Value-Passing Calculus. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) Theories of Programming and Formal Methods. LNCS, vol. 8051, pp. 166–195. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-39698-4_11 CrossRefGoogle Scholar
  13. [Fu16]
    Fu, Y.: Theory of interaction. Theoret. Comput. Sci. 611, 1–49 (2016)MathSciNetCrossRefMATHGoogle Scholar
  14. [Fu17]
    Fu, Y.: On the expressive power of name-passing communication. In: CONCUR 2017 (2017)Google Scholar
  15. [FZ15]
    Fu, Y., Zhu, H.: The name-passing calculus. arXiv:1508.00093 (2015)
  16. [Gor08]
    Gorla, D.: Comparing communication primitives via their relative expressive power. Inf. Comput. 206, 931–952 (2008)MathSciNetCrossRefMATHGoogle Scholar
  17. [GSV04]
    Giambiagi, P., Schneider, G., Valencia, F.D.: On the expressiveness of infinite behavior and name scoping in process calculi. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 226–240. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-24727-2_17 CrossRefGoogle Scholar
  18. [Hoa78]
    Hoare, C.: Communicating sequential processes. Commun. ACM 21, 666–677 (1978)CrossRefMATHGoogle Scholar
  19. [HT91a]
    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). doi: 10.1007/BFb0057019 CrossRefGoogle Scholar
  20. [HT91b]
    Honda, K., Tokoro, M.: On asynchronous communication semantics. In: Tokoro, M., Nierstrasz, O., Wegner, P. (eds.) ECOOP 1991. LNCS, vol. 612, pp. 21–51. Springer, Heidelberg (1992). doi: 10.1007/3-540-55613-3_2 CrossRefGoogle Scholar
  21. [LPSS08]
    Lanese, I., Perez, J., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. In: Proceedings of LICS 2008, pp. 145–155 (2008)Google Scholar
  22. [Mer00]
    Merro, M.: Locality in the \(\pi \)-calculus and applications to object-oriented languages. PhD thesis, Ecole des Mines de Paris (2000)Google Scholar
  23. [Mil89]
    Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)MATHGoogle Scholar
  24. [Mil92]
    Milner, R.: Functions as processes. Math. Struct. Comput. Sci. 2, 119–146 (1992)MathSciNetCrossRefMATHGoogle Scholar
  25. [Mil93]
    Milner, R.: The polyadic \(\pi \)-calculus: a tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. NATO ASI Series (Series F: Computer & Systems Sciences), vol. 94, pp. 203–246. Springer, Heidelberg (1993). doi: 10.1007/978-3-642-58041-3_6 CrossRefGoogle Scholar
  26. [MPW92]
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Inform. Comput. 100, 1–40 (Part I), 41–77 (Part II) (1992)Google Scholar
  27. [MS92]
    Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992). doi: 10.1007/3-540-55719-9_114 CrossRefGoogle Scholar
  28. [MS04]
    Merro, M., Sangiorgi, D.: On asynchrony in name-passing calculi. Math. Struct. Comput. Sci. 14, 715–767 (2004)MathSciNetCrossRefMATHGoogle Scholar
  29. [Pal03]
    Palamidessi, C.: Comparing the expressive power of the synchronous and the asynchronous \(\pi \)-calculus. Math. Struct. Comput. Sci. 13, 685–719 (2003)CrossRefGoogle Scholar
  30. [Par81]
    Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981). doi: 10.1007/BFb0017309 CrossRefGoogle Scholar
  31. [Pri78]
    Priese, L.: On the concept of simulation in asynchronous, concurrent systems. Progress Cybern. Syst. Res. 7, 85–92 (1978)Google Scholar
  32. [PS95]
    Parrow, J., Sangiorgi, D.: Algebraic theories for name-passing calculi. Inf. Comput. 120, 174–197 (1995)MathSciNetCrossRefMATHGoogle Scholar
  33. [Rog87]
    Rogers, H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)MATHGoogle Scholar
  34. [San93]
    Sangiorgi, D.: From \(\pi \)-calculus to higher-order \(\pi \)-calculus – and back. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993. LNCS, vol. 668, pp. 151–166. Springer, Heidelberg (1993). doi: 10.1007/3-540-56610-4_62 Google Scholar
  35. [San96a]
    Sangiorgi, D.: \(\pi \)-calculus, internal mobility and agent-passing calculi. Theoret. Comput. Sci. 167, 235–274 (1996)MathSciNetCrossRefMATHGoogle Scholar
  36. [San96b]
    Sangiorgi, D.: A theory of bisimulation for \(\pi \)-calculus. Acta Informatica 3, 69–97 (1996)MathSciNetCrossRefMATHGoogle Scholar
  37. [SW01]
    Sangiorgi, D., Walker, D.: The \(\pi \) Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)MATHGoogle Scholar
  38. [Tho95]
    Thomsen, B.: A theory of higher order communicating systems. Inf. Comput. 116, 38–57 (1995)MathSciNetCrossRefMATHGoogle Scholar
  39. [vGW89]
    van Glabbeek, R., Weijland, W.: Branching time and abstraction in bisimulation semantics. In: Information Processing 1989, North-Holland, pp. 613–618 (1989)Google Scholar
  40. [Wal95]
    Walker, D.: Objects in the \(\pi \)-calculus. Inf. Comput. 116, 253–271 (1995)MathSciNetCrossRefMATHGoogle Scholar
  41. [XYL15]
    Xu, X., Yin, Q., Long, H.: On the computation power of name parameterization in higher-order processes. In: ICE 2015 (2015)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.College of Computer and Information EngineeringShanghai Polytechnic UniversityShanghaiChina
  2. 2.BASICS, MOE-MS Key Laboratory for Intelligent Computing and Intelligent Systems, Department of Computer ScienceShanghai Jiao Tong UniversityShanghaiChina

Personalised recommendations