Abstract
Bisimulation is an equivalence relation widely used for comparing processes expressed in CCS and related process calculi [1,6,8,9]. Simulation is its asymmetric variant. The advantages of bisimilarity are simplicity, efficiency and variety. Proofs based bisimulation for particular programs can often be delegated to a model checker. Refinement is a weaker asymmetric relation used for the same purpose in CSP [2,3,14]. Its advantages are abstraction, expressive power and completeness. Refinement permits proofs of more equations and inequations than bisimilarity. When bisimulation and refinement are reconciled, all their distinctive advantages can be combined and exploited whenever the occasions demands. This paper shows how to link these two approaches by introducing an observation-preserving mapping, which gives rise a Galois connection between simulation and refinement. The same mapping is also applicable to coincide barbed simulation with failures/divergence refinement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Sciences 37(1), 77–121 (1985)
Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM 31 (1984)
Hoare, C.A.R.: Communicating sequential processes. Prentice-Hall, Englewood Cliffs (1985)
Hoare, C.A.R., Jifeng, H.: Unifying theories of programming. Prentice-Hall, Englewood Cliffs (1998)
Hoare, C.A.R.: Process Algebra: a Unifying Approach. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. LNCS, vol. 3525, pp. 36–60. Springer, Heidelberg (2005)
Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and control 94(1) (1991)
Mac Lane, S.: Categories for the Working Mathematicians. Springer, Heidelberg (1971)
Milner, R.: Communication and concurrency. Prentice-Hall, Englewood Cliffs (1989)
Milner, R.: Communicating and mobile systems: the π -calculus. Cambridge University Press, Cambridge (1999)
Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)
De Nicola, R., Hennessy, M.: Testing equivalence for processes. Theoretical Computer Science 34 (1983)
Park, D.M.R.: Concurrency and automata on infinite sequences. LNCS, vol. 14, pp. 167–183. Springer, Heidelberg (1981)
Plotkin, G.D.: A structural approach to operational semantics. Report DAIMI-FN-19, Computer Science Department, Aarhus University, Denmark (1981)
Roscoe, A.W.: The theory and practice of concurrency. Prentice-Hall, Englewood Cliffs (1998)
Tarski, A.: A lattice-theoretical fixed-point theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jifeng, H. (2005). Linking Theories of Concurrency. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds) Communicating Sequential Processes. The First 25 Years. Lecture Notes in Computer Science, vol 3525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423348_4
Download citation
DOI: https://doi.org/10.1007/11423348_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25813-1
Online ISBN: 978-3-540-32265-8
eBook Packages: Computer ScienceComputer Science (R0)