Abstract
We study several notions of process equivalence—viz. trace, failure, ready, and bisimulation equivalence—in the context of probabilistic labeled transition systems. We show that, unlike nondeterministic transition systems, “maximality” of traces and failures does not increase the distinguishing power of trace and failure equivalence, respectively. Thus, in the probabilistic case, trace and maximal trace equivalence coincide, and failure and ready equivalence coincide.
We then propose a language PCCS for communicating probabilistic processes, and present its operational semantics. We show that in PCCS, trace equivalence and failure equivalence are not congruences, whereas Larsen-Skou probabilistic bisimulation is. Furthermore, we prove that trace congruence, the largest congruence contained in trace equivalence, lies between failure equivalence and bisimulation equivalence in terms of its distinguishing strength.
Finally, we stress the similarity between classical process algebra and probabilistic process algebra by exhibiting sound and complete axiomatizations of bisimulation equivalence for finite and finite state probabilistic processes, which are natural extensions of the classical ones (R. Milner, “A complete inference system for a class of regular behaviours,” Journal of Computer and System Science, Vol. 28, 1984). Of particular interest is the rule for eliminating unguarded recursion, which characterizes the possibility of infinite syntactic substitution as a zero-probability event.
Professor Smolka's research was supported by the National Science Foundation under Grant CCR-8704309.
Preview
Unable to display preview. Download preview PDF.
References
S. Brookes, C.A.R. Hoare, A. Roscoe, “A theory of communicating sequential processes”, Journal of ACM, 31:3, 560–599 (1984).
J.A. Bergstra, J.W. Klop, “Algebra of communicating processes,” in CWI Monographs, Proceedings of the CWI Symposium on Mathematics and Computer Science (eds. J.W. de Bakker, M. Hazewinkel and J.K. Lenstra), 89–138, North Holland, Amsterdam (1986).
J.A. Bergstra, J.W. Klop, E.R. Olderog, “Readies and failures in the algebra of communicating processes,” SIAM Journal of Computing, Vol. 17, 1134–1177 (1988).
B. Bloom, A.R. Meyer, “A remark on bisimulation between probabilistic processes,” Logik at Botik, LNCS 363, eds. Meyer & Tsailin, Springer-Verlag (1989).
M. Broy, M. Wirsing, “On the algebraic specification of finitary infinite communicating sequential processes,” Working Conference on Formal Description of Programming Concept II, (ed. D. Björner), Germisch, June 1982, 171–196, North-Holland, Amsterdam (1982).
Ivan Christoff, “Testing equivalences and fully abstract models for probabilistic,” this volume.
C. Jones, G. D. Plotkin, “A Probabilistic powerdomain of evaluations”, Proceedings of 4th Annual Symposium on Logic in Computer Science, 186–195 (1989).
R.J. van Glabbeek, “Notes on the methodology of CCS and CSP,” Technical Report CS-R8624, Centre for Mathematics and Computer Science, The Netherlands.
R.J. van Glabbeek, “The linear time — branching time spectrum,” this volume.
A. Giacalone, C. Jou, S. A. Smolka, “Algebraic reasoning for probabilistic concurrent systems”, Proceedings of Working Conference on Programming Concepts and Methods, IFIP TC 2, Sea of Gallilee, Israel, April 1990.
R.J. van Glabbeek, S. A. Smolka, B. Steffen, C. Tofts, “Reactive, generative, and stratified models of probabilistic processes,” IEEE Symp. on Logic in Computer Science, Philadelphia, PA., USA, June 1990.
C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall International (1985).
K.G. Larsen, A. Skou, “Bisimulation through probabilistic testing,” Proceedings of 16th ACM Symp. on Principles of Programming Languages, Austin, TX (1989).
R. Milner, “Calculi for synchrony and asynchrony,” Theoret. Comput. Science, Vol.25, 267–310 (1983).
R. Milner, “A complete inference system for a class of regular behaviours,” Journal of Computer and System Science, Vol. 28, 439–466 (1984).
R. Milner, Communication and Concurrency, Prentice Hall International Series in Computer Science, United Kingdom (1989).
E. R. Olderog and C.A.R. Hoare, “Specification-oriented semantics for communicating processes,” Proceedings of 10th ICALP, Barcelona, ed. J. Diaz, LNCS 154, 561–572, Springer-Verlag (1983).
D. Park, “Concurrency and automata on infinite sequences”, Proc. 5th GI Conference, LNCS 104, Springer-Verlag (1981).
G. D. Plotkin, “A structural approach to operational semantics,” Technical Report DAIMI FN-19, Computer Science Department, Aarhus University (1981).
M.O. Rabin, “Probabilistic automata,” Information and Control, Vol. 6, 230–245 (1963).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jou, CC., Smolka, S.A. (1990). Equivalences, congruences, and complete axiomatizations for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039071
Download citation
DOI: https://doi.org/10.1007/BFb0039071
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53048-0
Online ISBN: 978-3-540-46395-5
eBook Packages: Springer Book Archive