Abstract
Larsen and Skou have recently demonstrated that the notion of bisimulation—which Milner introduced as a fundamental equivalence on concurrent processes—arises in a natural way as an “experimental” equivalence on probabilistic processes. In this paper we further clarify how bisimulation arises in this probabilistic setting: the transitions of two labelled transition systems can be assigned weights so that the trees are indistinguishable by a very general kind of probabilistic experiment iff the trees are bisimilar. However, we exhibit a pair of computable, bisimilar systems which are experimentally distinguishable for any computable weighting of their transitions.
Supported by an NSF Fellowship, also NSF Grant No. 8511190-DCR and ONR grant No. N00014-83-K-0125.
Supported by NSF Grant No. 8511190-DCR and by ONR grant No. N00014-83-K-0125.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Sci., 1986. Submitted.
S. Abramsky. Tutorial on concurrency. Invited Lecture at 15th ACM Symp. on Principles of Programming Languages, Jan. 1989.
B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can't be traced: preliminary report. In 15th Symp. Principles of Programming Languages, pages 229–239, ACM, 1988.
B. Bloom and A. R. Meyer. Experimenting with process equivalence. 1989. In Preparation.
M. C. B. Hennessy and R. Milner. On observing nondeterminism and concurrency. In J. D. Bakker and J. van Leeuwen, editors, 7th ICALP, pages 299–309, Volume 85 of Lect. Notes in Computer Sci., Springer-Verlag, 1980.
C. Hoare. Communicating sequential processes. Comm. ACM, 21:666–677, 1978.
C. A. R. Hoare. Communicating Sequential Processes. Series in Computer Science, Prentice-Hall, 1985. 256 pp.
K. Larsen and A. Skou. Bisimulation through probabilistic testing (preliminary report). Technical Report R 88-16, Institut for Elektroniske Systemer, Aalborg Universitetscenter, June 1988. Also in 15th ACM Symp. on Principles of Programming Languages, Jan. 1989.
R. Milner. A Calculus of Communicating Systems. Volume 92 of Lect. Notes in Computer Sci., Springer-Verlag, 1980.
R. Milner. A modal characterisation of observable machine-behavior. In Proceedings CAAP '81, Volume 112 of Lect. Notes in Computer Sci., Springer-Verlag, 1981.
R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Sci., 25:267–310, 1983.
R. Milner. Lectures on a calculus for communicating systems. In S. D. Brookes, A. W. Roscoe, and G. Winskel, editors, Seminar on Concurrency, pages 197–220, Volume 197 of Lect. Notes in Computer Sci., Springer-Verlag, 1984.
G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus Univ., Computer Science Dept., Denmark, 1981.
A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In W. Brauer, editor, Int'l Conf. Automata, Languages and Programming, pages 15–32, Volume 194 of Lect. Notes in Computer Sci., Springer-Verlag, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bloom, B., Meyer, A.R. (1989). A remark on bisimulation between probabilistic processes. In: Meyer, A.R., Taitslin, M.A. (eds) Logic at Botik '89. Logic at Botik 1989. Lecture Notes in Computer Science, vol 363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51237-3_4
Download citation
DOI: https://doi.org/10.1007/3-540-51237-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51237-0
Online ISBN: 978-3-540-46180-7
eBook Packages: Springer Book Archive