Abstract
We propose in this paper barbed bisimulation as a tool to describe bisimulation-based equivalence uniformly for any calculi possessing (a) a reduction relation and (b) a convergency predicate which simply detects the possibility of performing some observable action. This opens interesting perspectives for the adoption of a reduclion semanlics in process algebras. As a test-case we prove that strong bisimulation of CCS coincides with the congruence induced by barbed bisimulation.
Cite
CITATION STYLE
Milner, R., & Sangiorgi, D. (1992). Barbed bisimulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 623 LNCS, pp. 685–695). Springer Verlag. https://doi.org/10.1007/3-540-55719-9_114
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
