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

9. van Glabbeek, R.: The linear time—branching time spectrum II; the semantics of sequential
systems with silent moves. Proceedings of the 4th International Conference on Concurrency
Theory. Lecture Notes in Computer Science, vol. 715, pp. 66-81. Springer, Heidelberg (1993)
10. Brookes, S., Hoare, C., Roscoe, A.: A theory of communicating sequential processes. J. ACM
31 (3), 560-599 (1984)
11. Olderog, E.R., Hoare, C.: Specification-oriented semantics for communicating processes. Acta
Inf. 23 , 9-66 (1986)
12. Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities.
Proceedings of IEEE Real-Time Systems Symposium, pp. 278-287. IEEE Computer Society
Press (1990)
13. Jonsson, B., Yi, W., Larsen, K.G.: Probabilistic extensions of process algebras. Handbook of
Process Algebra, Chapter. 11, pp. 685-710. Elsevier (2001)
14. Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Proceedings of
the 5th International Conference on Concurrency Theory. Lecture Notes in Computer Science,
vol. 836, pp. 481-496. Springer, Heidelberg (1994)
15. Milner, R.: Communication and Concurrency. Prentice Hall, New York (1989)
16. Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.C., Zhang, C.: Characterising testing
preorders for finite probabilistic processes. Proceedings of the 22nd Annual IEEE Symposium
on Logic in Computer Science, pp. 313-325. IEEE Computer Society (2007)
17. Deng, Y., Tiu, A.: Characterisations of testing preorders for a finite probabilistic ˀ -calculus.
Form. Asp. Comput. 24 (4-6), 701-726 (2012)
18. Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94 (1), 1-28
(1991)
19. van Glabbeek, R., Smolka, S.A., Steffen, B., Tofts, C.: Reactive, generative, and stratified
models of probabilistic processes. Proceedings of the 5th Annual IEEE Symposium on Logic
in Computer Science, pp. 130-141. Computer Society Press (1990)
20. van Glabbeek, R., Weijland, W.: Branching time and abstraction in bisimulation semantics. J.
ACM 43 (3), 555-600 (1996)
21. Philippou, A., Lee, I., Sokolsky, O.: Weak bisimulation for probabilistic systems. Proceedings
of the 11th International Conference on Concurrency Theory. Lecture Notes in Computer
Science, vol. 1877, pp. 334-349. Springer, Heidelberg (2000)
22. Andova, S., Baeten, J.C.: Abstraction in probabilistic process algebra. Proceedings of the
7th International Conference on Tools and Algorithms for the Construction and Analysis of
Systems. Lecture Notes in Computer Science, vol. 2031, pp. 204-219. Springer, Heidelberg
(2001)
23. Bandini, E., Segala, R.: Axiomatizations for probabilistic bisimulation. In: Proceedings of the
28th International Colloquium on Automata, Languages and Programming. Lecture Notes in
Computer Science, vol. 2076, pp. 370-381. Springer (2001)
24. Deng, Y., Palamidessi, C.: Axiomatizations for probabilistic finite-state behaviors. Proceedings
of the 8th International Conference on Foundations of Software Science and Computation
Structures. Lecture Notes in Computer Science, vol. 3441, pp. 110-124. Springer, Heidelberg
(2005)
25. Andova, S., Willemse, T.A.: Branching bisimulation for probabilistic systems: Characteristics
and decidability. Theor. Comput. Sci. 356 (3), 325-355 (2006)
26. Deng, Y., Palamidessi, C., Pang, J.: Compositional reasoning for probabilistic finite-state
behaviors. Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to
Jan Willem Klop, on the Occasion of His 60th Birthday. Lecture Notes in Computer Science,
vol. 3838, pp. 309-337. Springer, Heidelberg (2005)
27. Andova, S., Baeten, J.C., Willemse, T.A.: A complete axiomatisation of branching bisimula-
tion for probabilistic systems with an application in protocol verification. Proceedings of the
17th International Conference on Concurrency Theory. Lecture Notes in Computer Science,
vol. 4137, pp. 327-342. Springer, Heidelberg (2006)
28. Lowe, G.: Representing nondeterminism and probabilistic behaviour in reactive processes.
Technical Report TR-11-93, Computing laboratory, Oxford University (1993)