Skip to main content

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

Abstract

In this paper, we study weak bisimulation congruences for the χ-calculus, a symmetric variant of the π-calculus. We distinguish two styles of such bisimulation definitions, i.e. “open” and “closed” bisimulation, the difference between which lies in that in open style the equivalence is closed under context in every bisimulation step whereas in closed style the equivalence is closed under context only at the very beginning. As a result, we show that both in labelled and barbed congruence, the open and closed style definitions coincide. Thus all bisimulation congruences collapse into two equivalences, that is, the well-known open congruence and open barbed congruence, which are the same in the strong case, while in the weak case their difference can be reflected by one axiom. The results of this paper close some conjectures in the literatures and shed light on the algebraic theory of a large class of mobile process calculi.

This work is partially supported by NNSFC (60233010, 60273034, 60403014) and 973 Program of China (2002CB312002).

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL, pp. 104–115 (2001)

    Google Scholar 

  2. Chen, T.: Research on the Theory and Application of Mobile Process Calculi. Master’s thesis, Nanjing University, Nanjing, P.R.China (2005)

    Google Scholar 

  3. Chen, T., Han, T., Lu, J.: On bisimulation congruence in χ-calculus. Technical report, CWI, Amsterdam, The Netherlands (2005)

    Google Scholar 

  4. Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. J. Log. Algebr. Program. 63, 131–1739 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Fu, Y.: A proof theoretical approach to communication. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 325–335. Springer, Heidelberg (1997)

    Google Scholar 

  6. Fu, Y.: Bisimulation congruence of chi calculus. Inf. Comput. 184(1), 201–226 (2003)

    Article  MATH  Google Scholar 

  7. Fu, Y., Yang, Z.: Understanding the mismatch combinator in chi calculus. Theor. Comput. Sci. 290(1), 779–830 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gardner, P., Wischik, L.: Explicit fusions. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 373–382. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Honda, K., Yoshida, N.: On reduction-based process semantics. Theor. Comput. Sci. 151(2), 437–486 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  11. Milner, R., Parrow, J., Walker, D.: A calculus of mobile process, part I/II. Inf. Comput. 100, 1–77 (1992)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  13. Parrow, J., Victor, B.: The update calculus (extended abstract). In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 409–423. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  14. Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: LICS, pp. 176–185 (1998)

    Google Scholar 

  15. Sangiorgi, D.: A theory of bisimulation for the π-calculus. Acta Inf. 33(1), 69–97 (1996)

    Article  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

  17. Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  18. Wischik, L., Gardner, P.: Strong bisimulation for the explicit fusion calculus. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 484–498. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, T., Han, T., Lu, J. (2005). On the Bisimulation Congruence in χ-Calculus. In: Sarukkai, S., Sen, S. (eds) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2005. Lecture Notes in Computer Science, vol 3821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590156_10

Download citation

  • DOI: https://doi.org/10.1007/11590156_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30495-1

  • Online ISBN: 978-3-540-32419-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics