Testing Finite Probabilistic Processes - Semantics of Probabilistic Processes: An Operational Approach - page 146

29. Seidel, K.: Probabilistic communicating processes. Theor. Comput. Sci. 152 (2), 219-249
(1995)
30. Morgan, C.C., McIver, A.K., Seidel, K., Sanders, J.: Refinement-oriented probability for CSP.
Form. Asp. Comput. 8 (6), 617-647 (1996)
31. Jones, C., Plotkin, G.: A probabilistic powerdomain of evaluations. Proceedings of the 4th
Annual IEEE Symposium on Logic in Computer Science, pp. 186-195. Computer Society
Press (1989)
32. Mislove, M.W.: Nondeterminism and probabilistic choice: Obeying the laws. Proceedings of
the 11th International Conference on Concurrency Theory. Lecture Notes in Computer Science,
vol. 1877, pp. 350-364. Springer, Heidelberg (2000)
33. Jou, C.C., Smolka, S.A.: Equivalences, congruences, and complete axiomatizations for prob-
abilistic processes. Proceedings of the 1st International Conference on Concurrency Theory.
Lecture Notes in Computer Science, vol. 458, pp. 367-383. Springer, Heidelberg (1990)
34. Park, D.: Concurrency and automata on infinite sequences. Proceedings of the 5th GI Con-
ference. Lecture Notes in Computer Science, vol. 104, pp. 167-183. Springer, Heidelberg
(1981)
35. Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. Proceedings
of the 6th Annual IEEE Symposium on Logic in Computer Science, pp. 266-277. Computer
Society Press (1991)
36. Jonsson, B., Yi, W.: Testing preorders for probabilistic processes can be characterized by
simulations. Theor. Comput. Sci. 282 (1), 33-51 (2002)