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 reduction semantics in process algebras. As a test-case we prove that strong bisimulation of CCS coincides with the congruence induced by barbed bisimulation.
Supported by a grant from Consiglio Nazionale delle Ricerche, Italy
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S., The Lazy Lambda Calculus, in Declarative Programming, ed. Addison Wesley, 1988.
Berry, G. and Boudol, G., The Chemical Abstract Machine, Proc 17th Annual Symposium on Principle of Programming Languages, 1990.
Boudol, G., A Lambda Calculus for Parallel Functions, Rapport de Recherche 1231, INRIA-Sophia Antipolis, 1990.
Groote, J. F., Transition System Specifications with Negative Premises, Report CS-R8950, Centrum voor Wiskunde in Informatica, Amsterdam.
Groote, J.F. and Vaandrager, F.W., Structured Operational Semantics and Bisimulation as a Congruence, in Proc. ICALP '89, LNCS 372, 423–438, Springer Verlag, 1989.
ISO DIS 8807, Information Processing Systems — Open System Interconnection, LOTOS, A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, 1987.
Milner, R., Communication and Concurrency, Prentice Hall, 1989.
Milner, R., Functions as Processes, Report N.1154, INRIA-Roquencourt, 1990, to appear in Journal of Mathematical Structures in Computer Science.
Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes, Parts I and II, Report ECS-LFCS-89-85 and-86, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, to appear in Journal of Information and Computation.
Milner, R., Parrow, J.G. and Walker, D.J., Modal Logics for Mobile Processes, in Proc. CONCUR '91, LNCS 527, pp. 45–60, Springer Verlag, 1991.
Sangiorgi, D., forthcoming PhD thesis, Computer Science Department, Edinburgh University, 1992.
Thomsen, B., Plain CHOCS, Report DOC 89/4, Department of Computing, Imperial College, London, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milner, R., Sangiorgi, D. (1992). Barbed bisimulation. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_114
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_114
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive