In this paper, we prove the coincidence between strong/weak context bisimulation and strong/weak normal bisimulation for higher order π-calculus, which generalizes Sangiorgi’s work. To achieve this aim, we introduce indexed higher order π-calculus, which is similar to higher order π-calculus except that every prefix of any process is assigned to indices. Furthermore we present corresponding indexed bisimulations for this calculus, and prove the equivalence between these indexed bisimulations. As an application of this result, we prove the equivalence between strong/weak context bisimulation and strong/weak normal bisimulation.


Operational Semantic Factorisation Theorem Label Transition System Proof Strategy High Order Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Cao, Z.: A uniform reduction equivalence for process calculi. In: Chin, W.-N. (ed.) APLAS 2004. LNCS, vol. 3302, pp. 179–195. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. 2.
    Jeffrey, A., Rathke, J.: A theory of bisimulation for a fragment of concurrent ML with local names. Theoretical Computer Science 323, 1–48 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order π-calculus revisited. Logical Methods in Computer Science 1(1:4), 1–22 (2005)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Li, Y., Liu, X.: Towards a theory of bisimulation for the higher-order process calculi. Journal of Computer Science and Technology 19(3), 352–363 (2004)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (Part I and II). Information and Computation 100, 1–77 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D thesis, University of Einburgh (1992)Google Scholar
  7. 7.
    Sangiorgi, D.: Bisimulation in higher-order calculi, Information and Computation.  131(2), 141–178 (1996)Google Scholar
  8. 8.
    Sangiorgi, D., Walker, D.: The π-calculus: a theory of mobile processes. Cambridge University Press, Cambridge (2001)zbMATHGoogle Scholar
  9. 9.
    Thomsen, B.: Plain CHOCS, a second generation calculus for higher order processes. Acta Information 30, 1–59 (1993)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Zining Cao
    • 1
  1. 1.Department of Computer Science and EngineeringNanjing University of Aero. & Astro.NanjingP.R. China

Personalised recommendations