Abstract
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.
Keywords
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.
This work was supported by the National Science Foundation of China under Grant 60473036.
Download to read the full chapter text
Chapter PDF
References
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)
Jeffrey, A., Rathke, J.: A theory of bisimulation for a fragment of concurrent ML with local names. Theoretical Computer Science 323, 1–48 (2004)
Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order π-calculus revisited. Logical Methods in Computer Science 1(1:4), 1–22 (2005)
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)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (Part I and II). Information and Computation 100, 1–77 (1992)
Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D thesis, University of Einburgh (1992)
Sangiorgi, D.: Bisimulation in higher-order calculi, Information and Computation. 131(2), 141–178 (1996)
Sangiorgi, D., Walker, D.: The π-calculus: a theory of mobile processes. Cambridge University Press, Cambridge (2001)
Thomsen, B.: Plain CHOCS, a second generation calculus for higher order processes. Acta Information 30, 1–59 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cao, Z. (2006). More on Bisimulations for Higher Order π-Calculus. In: Aceto, L., Ingólfsdóttir, A. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2006. Lecture Notes in Computer Science, vol 3921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11690634_5
Download citation
DOI: https://doi.org/10.1007/11690634_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33045-5
Online ISBN: 978-3-540-33046-2
eBook Packages: Computer ScienceComputer Science (R0)