Skip to main content
SpringerLink
Log in

Towards a theory of bisimulation for the higher-order process calculi

  • Formal Methods
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, a labelled transition semantics for higher-order process calculi is studied. The labelled transition semantics is relatively clean and simple, and corresponding bisimulation equivalence can be easily formulated based on it. And the congruence properties of the bisimulation equivalence can be proved easily. To show the correspondence between the proposed semantics and the well-established ones, the bisimulation is characterized as a version of barbed equivalence and a version of context bisimulation.

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. Caculus of communicating systems.LNCS 92, Springer Verlag, 1980.

  2. Park D. Concurrency and automata on infinite sequences.LNCS 104, Springer Verlag, 1981.

  3. Milner R. Communication and Concurrency. Prentice Hall, 1989.

  4. Milner R, Parrow J, Walker D. A calculus of mobile processes. (Parts I and II).Information and Computation, 1992, 100(1): 1–40.

    Article  MATH  MathSciNet  Google Scholar 

  5. Sangiorgi D. Expressing mobility in process algebras: First-order and higher-order paradigms, [Dissertation]. University of Edinburgh, Edinburgh, U.K., 1992.

    Google Scholar 

  6. Thomsen B. Calculus for high order communicating systems [Dissertation]. Department of Computing, Imperial College, 1990.

  7. Astesiano E, Giovini A. Generalized bisimulation in relational specifications. LNCS 294, Springer-Verlage, pp. 207–266.

  8. Boudol G. Towards a lambda calculus for concurrent and communicating systems.LNCS 351, Springer-Verlag, Barcelona, Spain, March 13–17, 1989, pp. 149–161.

    Google Scholar 

  9. Peter Sewell. From rewrite rules to bisimulation congruences. InProc. Concur'98, LNCS 1466, Springer Verlag, Nice, France, 1998, pp. 269–284.

    Chapter  Google Scholar 

  10. Milner R. The polyadic π-calculus: A tutorial. InProc. the International Summer School on Logic and Algebra of Specification, 1991.

  11. Sangiorgi D, Walker D.The π-Calculus: A Theory of Mobile Processes. Cambridge University Press, 2001, pp. 42–43.

  12. Kohei Honda, Nobuko Yoshida. On reduction-based process semantics.Theoretical Computer Science, 1995, 152(2): 437–486.

    Article  MathSciNet  Google Scholar 

  13. Fournet C, Gonthier G. A hierarchy of equivalence for asynchronous calculi. In:Proc. International Colloquium on Algorithms, Language and Programming, LNCS 1443, Springer-Verlag, Aalborg, Denmark, July 13–17, 1998, pp. 844–855.

    Google Scholar 

  14. Sangiorgi D. Bisimulation for higher-order process calculi.Information and Computation, 1996, 131(2): 141–178.

    Article  MATH  MathSciNet  Google Scholar 

  15. Liu Xinxin, Li Yongjian. Bisimulation for higher-order π-calculus. InProc. the Third Asian Workshop on Programming Language and Systems (Aplas'03), 2002.

  16. Alan Jeffery, Julian Rathke. A theory of bisimulation for a fragment of concurrent CML with local names. InProc. Logic in Computer Science, IEEE CS Press, Santa Barbara, California, June 26–28, 2000, pp. 311–321.

    Google Scholar 

  17. Luca Cardelli, Andrew D Gordon. Mobile ambients. In:Proc. Foundations of Software Science and Computation Structures (FossaCs), ETAPS'98,LNCS 1378, Pertugal, Springer-Verlag, 1998 pp. 140–155.

    Google Scholar 

  18. Cedric Fournet, Georeges Gonthier. The reflexive cham and the join-calculus. InProc. the 23rd Annual ACM Symposium on Principles of Programming Languages, 1996, pp. 372–385.

Download references

Author information

Authors and Affiliations

  1. Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Yong-Jian Li & Xin-Xin Liu

Authors
  1. Yong-Jian Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xin-Xin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yong-Jian Li.

Additional information

This work is supported by the National Natural Science Foundation of China under Grant No. 60173020.

Yong-Jian Li received his Ph.D. degree in computer science from Shanghai Jiao Tong university in 2001. He is an assistant researcher in the Laboratory of Computer Science, institute of Software, the Chinese Academy of Sciences. His current research interests are concurrency theory, semantics of programming language, application of formal methods.

Xin-Xin Liu received his Ph.D. degree in computer science from Aalborg university in Denmark in 1992. He is a researcher in the Laboratory of Computer Science, Institute of Software, the Chinese Academy of Sciences. His current research interests are concurrency theory, function programming language, model checking.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, YJ., Liu, XX. Towards a theory of bisimulation for the higher-order process calculi. J. Comput. Sci. & Technol. 19, 352–363 (2004). https://doi.org/10.1007/BF02944905

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02944905

Keywords

Search

Navigation