Probabilistic Testing Semantics - Semantics of Probabilistic Processes: An Operational Approach - page 100

18. Jonsson, B., Yi, W.: Testing preorders for probabilistic processes can be characterized by
simulations. Theor. Comput. Sci. 282 (1), 33-51 (2002)
19. Cazorla, D., Cuartero, F., Ruiz, V., Pelayo, F., Pardo, J.: Algebraic theory of probabilistic and
nondeterministic processes. J. Log. Algebr. Program. 55 (1-2), 57-103 (2003)
20. Cleaveland, R., Smolka, S.A., Zwarico, A.: Testing preorders for probabilistic processes.
Proceedings of the 19th International Colloquium on Automata, Languages and Programming.
Lecture Notes in Computer Science, vol. 623, pp. 708-719. Springer, Heidelberg (1992)
21. Bernardo, M., Sangiorgi, D., Vignudelli, V.: On the discriminating power of testing equiva-
lences for reactive probabilistic systems: Results and open problems. Proceedings of the 11th
International Conference on Quantitative Evaluation of Systems. Lecture Notes in Computer
Scienc, vol. 8567, pp. 281-296. Springer, Heidelberg (2014)
22. Jonsson, B., Yi, W.: Fully abstract characterization of probabilistic may testing. Proceedings of
the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic
Systems. Lecture Notes in Computer Science, vol. 1601, pp. 1-18. Springer, Heidelberg (1999)
23. Morgan, C.C., McIver, A.K., Seidel, K., Sanders, J.: Refinement-oriented probability for CSP.
Form. Asp. Comput. 8 (6), 617-647 (1996)
24. Acciai, L., Boreale, M., De Nicola, R.: Linear-time and may-testing semantics in a probabilistic
reactive setting. Proceedings of FMOODS-FORTE'11. Lecture Notes in Computer Science,
vol. 6722, pp. 29-43. Springer, Heidelberg (2011)
25. Stoelinga, M., Vaandrager, F.W.: A testing scenario for probabilistic automata. Proceedings of
the 30th International Colloquium on Automata, Languages and Programming. Lecture Notes
in Computer Science, vol. 2719, pp. 407-18. Springer, Heidelberg (2003)
26. Bernardo, M., De Nicola, R., Loreti, M.: Revisiting trace and testing equivalences for
nondeterministic and probabilistic processes. Log. Methods Comput. Sci. 10 (1:16), 1-42
(2014)
27. de Alfaro, L., Henzinger, T., Jhala, R.: Compositional methods for probabilistic systems.
Proceedings of the 12th International Conference on Concurrency Theory. Lecture Notes in
Computer Science, vol. 2154, pp. 351-365. Springer, Heidelberg (2001)
28. Cheung, L., Lynch, N., Segala, R., Vaandrager, F.: Switched PIOA: Parallel composition via
distributed scheduling. Theor. Comput. Sci. 365 (1-2), 83-108 (2006)
29. Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler.
Proceedings of the 18th International Conference on Concurrency Theory. Lecture Notes in
Computer Science, vol. 4703, pp. 42-58. Springer, Heidelberg (2007)
30. Giro, S., D'Argenio, P.: On the expressive power of schedulers in distributed probabilistic
systems. Electron. Notes Theor. Comput. Sci. 253 (3), 45-71 (2009)
31. Georgievska, S., Andova, S.: Probabilistic may/must testing: Retaining probabilities by
restricted schedulers. Form. Asp. Comput. 24 , 727-748 (2012)