L. Acciai, M. Boreale, and R. De-nicola, Linear-Time and May-Testing in a Probabilistic Reactive Setting
DOI : 10.1137/0221017
URL : https://hal.archives-ouvertes.fr/hal-01583326

C. Baier, On the algorithmic verification of probabilistic systems, 1998.

M. Boreale, R. De-nicola, and R. Pugliese, Trace and Testing Equivalence on Asynchronous Processes, Information and Computation, vol.172, issue.2, pp.139-164, 2002.
DOI : 10.1006/inco.2001.3080
URL : http://doi.org/10.1006/inco.2001.3080

K. Chatzikokolakis and C. Palamidessi, Making random choices invisible to the scheduler, Proc. of CONCUR, pp.42-58, 2007.
DOI : 10.1016/j.ic.2009.06.006
URL : https://hal.archives-ouvertes.fr/inria-00200967

R. Cleaveland, S. P. Iyer, and M. Narasimha, Probabilistic temporal logics via the modal mucalculus, Theor. Comput. Sci, vol.342, issue.2-3, 2005.
DOI : 10.1016/j.tcs.2005.03.048
URL : http://doi.org/10.1016/j.tcs.2005.03.048

D. Deng, R. Van-glabbeek, M. Hennessy, and C. Morgan, Testing Finitary Probabilistic Processes, Proc. of CONCUR, pp.274-288, 2009.
DOI : 10.1007/978-3-642-04081-8_19

D. Deng, R. Van-glabbeek, M. Hennessy, and C. Morgan, Characterising testing preorders for finite probabilistic processes, Logical Methods in Computer Science, vol.4, issue.4, pp.1-33, 2008.
DOI : 10.2168/lmcs-4(4:4)2008
URL : http://arxiv.org/pdf/0810.3708

D. Nicola and R. , Extensional equivalences for transition systems, Acta Informatica, vol.24, issue.2, pp.211-237, 1987.
DOI : 10.1007/BF00264365

D. Nicola, R. Hennessy, and M. , Testing equivalences for processes, Theoretical Computer Science, vol.34, issue.1-2, pp.83-133, 1984.
DOI : 10.1016/0304-3975(84)90113-0

Z. Ésik and W. Kuich, Formal Tree Series, Journal of Automata, Languages and Combinatorics, vol.8, issue.2, pp.219-285, 2003.

S. Georgievska and S. Andova, Retaining the Probabilities in Probabilistic Testing Theory, Proc. of FOSSACS, pp.79-93, 2010.
DOI : 10.1007/978-3-642-12032-9_7

R. Van-glabbeek, S. Smolka, B. Steffen, and C. Tofts, Reactive, generative, and stratified models of probabilistic processes, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.59-80, 1995.
DOI : 10.1109/LICS.1990.113740

R. J. Van-glabbeek, The linear time - branching time spectrum, Proc. of CONCUR, pp.278-297, 1990.
DOI : 10.1007/BFb0039066

P. Halmos, Measure theory, 1950.
DOI : 10.1007/978-1-4684-9440-2

H. Hansson and B. Jonsson, A calculus for communicating systems with time and probabilities, [1990] Proceedings 11th Real-Time Systems Symposium, pp.278-287, 1990.
DOI : 10.1109/REAL.1990.128759

M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-161, 1985.
DOI : 10.1145/2455.2460
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.1770

B. Jonsson and W. Yi, Testing preorders for probabilistic processes can be characterized by simulations, Theoretical Computer Science, vol.282, issue.1, pp.33-51, 2002.
DOI : 10.1016/S0304-3975(01)00044-5
URL : http://doi.org/10.1016/s0304-3975(01)00044-5

K. G. Larsen and A. Skou, Bisimulation through probabilistic testing, Information and Computation, vol.94, issue.1, pp.1-28, 1991.
DOI : 10.1016/0890-5401(91)90030-6
URL : http://doi.org/10.1016/0890-5401(91)90030-6

R. Segala, Testing probabilistic automata, Proc. of CONCUR, pp.299-314, 1996.
DOI : 10.1007/3-540-61604-7_62
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.6403

W. Tzeng, A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata, SIAM Journal on Computing, vol.21, issue.2, pp.216-227, 1992.
DOI : 10.1137/0221017

Y. Wang and K. G. Larsen, Testing Probabilistic and Nondeterministic Processes, Proc. of PSTV, pp.47-61, 1992.