Probabilistic Bisimulation - Semantics of Probabilistic Processes: An Operational Approach - page 65

3. Larsen, K.G., Skou, A.: Compositional verification of probabilistic processes. Proceedings of
the 3rd International Conference on Concurrency Theory. Lecture Notes in Computer Science,
vol. 630, pp. 456-471. Springer, Heidelberg (1992)
4. 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)
5. Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. Proceedings of
the IFIP TC6/WG6.1 12th International Symposium on Protocol Specification, Testing and
Verification, IFIP Transactions, vol. C-8, pp. 47-61. North-Holland (1992)
6. 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)
7. Lowe, G.: Probabilistic and prioritized models of timed CSP. Theor. Comput. Sci. 138 , 315-352
(1995)
8. Segala, R.: Modeling and verification of randomized distributed real-time systems. Tech. Rep.
MIT/LCS/TR-676, PhD thesis, MIT, Dept. of EECS (1995)
9. Morgan, C.C., McIver, A.K., Seidel, K.: Probabilistic predicate transformers. ACM Trans.
Progr. Lang. Syst. 18 (3), 325-353 (1996)
10. He, J., Seidel, K., McIver, A.K.: Probabilistic models for the guarded command language. Sci.
Comput. Program. 28 , 171-192 (1997)
11. Huth, M., Kwiatkowska, M.: Quantitative analysis and model checking. Proceedings of the
12th Annual IEEE Symposium on Logic in Computer Science, pp. 111-122. IEEE Computer
Society (1997)
12. McIver, A., Morgan, C.: An expectation-based model for probabilistic temporal logic. Tech.
Rep. PRG-TR-13-97, Oxford University Computing Laboratory (1997)
13. Bandini, E., Segala, R.: Axiomatizations for probabilistic bisimulation. Proceedings of the
28th International Colloquium on Automata, Languages and Programming, Lecture Notes in
Computer Science, vol. 2076, pp. 370-381. Springer (2001)
14. Jonsson, B., Yi, W.: Testing preorders for probabilistic processes can be characterized by
simulations. Theor. Comput. Sci. 282 (1), 33-51 (2002)
15. Mislove, M.M., Ouaknine, J., Worrell, J.: Axioms for probability and nondeterminism.
Electron. Notes Theor. Comput. Sci. 96 , 7-28 (2004)
16. Cleaveland, R., Iyer, S.P., Narasimha, M.: Probabilistic temporal logics via the modal mu-
calculus. Theor. Comput. Sci. 342 (2-3), 316-350 (2005)
17. Tix, R., Keimel, K., Plotkin, G.: Semantic domains for combining probability and
non-determinism. Electron. Notes Theor. Comput. Sci. 129 , 1-104 (2005)
18. McIver, A., Morgan, C.: Results on the quantitative mu-calculus. ACM Trans. Comput. Logic
8 (1) (2007)
19. Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.C., Zhang, C.: Remarks on testing
probabilistic processes. Electron Notes Theor. Comput. Sci. 172 , 359-397 (2007)
20. Deng, Y., van Glabbeek, R., Morgan, C.C., Zhang, C.: Scalar outcomes suffice for finitary
probabilistic testing. Proceedings of the 16th European Symposium on Programming. Lecture
Notes in Computer Science, vol. 4421, pp. 363-378. Springer, Heidelberg (2007)
21. Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.C.: Characterising testing preorders for
finite probabilistic processes. Log. Methods Comput. Sci. 4 (4), 1-33 (2008)
22. Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.: Testing finitary probabilistic processes
(extended abstract). Proceedings of the 20th International Conference on Concurrency Theory.
Lecture Notes in Computer Science, vol. 5710, pp. 274-288. Springer, Heidelberg (2009)
23. Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94 (1), 1-28
(1991)
24. Deng, Y., Du, W.: Probabilistic barbed congruence. Electron. Notes Theor. Comput. Sci.
190 (3), 185-203 (2007)
25. Kantorovich, L.: On the transfer of masses (in Russian). Dokl. Akademii Nauk 37 (2), 227-229
(1942)