S. Abramsky, Observation equivalence as a testing equivalence, Theoretical Computer Science, vol.53, issue.2-3, pp.225-241, 1987.
DOI : 10.1016/0304-3975(87)90065-X

C. Baier and M. Kwiatkowska, Domain equations for probabilistic processes, Mathematical Structures in Computer Science, vol.10, issue.6, pp.665-717, 2000.
DOI : 10.1017/S0960129599002984

M. Bernardo, R. De-nicola, and M. Loreti, Revisiting trace and testing equivalences for nondeterministic and probabilistic processes, Logical Methods in Computer Science, vol.10, issue.116, pp.1-42, 2014.

M. Bernardo, R. De-nicola, and M. Loreti, Relating strong behavioral equivalences for processes with nondeterminism and probabilities, Theoretical Computer Science, vol.546, 2014.
DOI : 10.1016/j.tcs.2014.03.001

M. Bernardo, D. Sangiorgi, and V. Vignudelli, On the discriminating power of passivation and higher-order interaction, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2014.
DOI : 10.1145/2603088.2603113
URL : https://hal.archives-ouvertes.fr/hal-01089467

B. Bloom and A. R. Meyer, A remark on bisimulation between probabilistic processes, Proc. of Logic at Botik, pp.26-40, 1989.
DOI : 10.1007/3-540-51237-3_4

F. Van-breugel, M. Mislove, J. Ouaknine, and J. Worrell, Domain theory, testing and simulation for labelled Markov processes, Theoretical Computer Science, vol.333, issue.1-2, pp.171-197, 2005.
DOI : 10.1016/j.tcs.2004.10.021

S. D. Brookes, C. A. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM, vol.31, issue.3, pp.560-599, 1984.
DOI : 10.1145/828.833

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

R. , D. Nicola, and M. Hennessy, Testing equivalences for processes, Theoretical Computer Science, vol.34, pp.83-133, 1984.

Y. Deng, R. J. Van-glabbeek, M. Hennessy, and C. Morgan, Characterising Testing Preorders for Finite Probabilistic Processes, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.1-33, 2008.
DOI : 10.1109/LICS.2007.15

Y. Deng, R. J. Van-glabbeek, M. Hennessy, C. Morgan, and C. Zhang, Remarks on Testing Probabilistic Processes, Computation, Meaning, and Logic: Articles Dedicated to Gordon Plotkin, pp.359-397, 2007.
DOI : 10.1016/j.entcs.2007.02.013

Y. Deng, R. J. Van-glabbeek, C. Morgan, and C. Zhang, Scalar Outcomes Suffice for Finitary Probabilistic Testing, Proc. of ESOP, pp.363-378, 2007.
DOI : 10.1007/978-3-540-71316-6_25

J. Desharnais, A. Edalat, and P. Panangaden, Bisimulation for Labelled Markov Processes, Information and Computation, vol.179, issue.2, pp.163-193, 2002.
DOI : 10.1006/inco.2001.2962

R. J. Van-glabbeek, The linear time - branching time spectrum, Handbook of Process Algebra, pp.3-99, 2001.
DOI : 10.1007/BFb0039066

R. J. Van-glabbeek, S. A. Smolka, and B. Steffen, 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

D. T. Huynh and L. Tian, On some equivalence relations for probabilistic processes, Fundamenta Informaticae, vol.17, pp.211-234, 1992.

B. Jonsson, C. Ho-stuart, and W. Yi, Testing and refinement for nondeterministic and probabilistic processes, Proc. of FTRTFT, pp.418-430, 1994.
DOI : 10.1007/3-540-58468-4_176

B. Jonsson and K. G. Larsen, Specification and refinement of probabilistic processes, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.266-277, 1991.
DOI : 10.1109/LICS.1991.151651

B. Jonsson and W. Yi, Compositional testing preorders for probabilistic processes, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, pp.431-441, 1995.
DOI : 10.1109/LICS.1995.523277

C. Jou and S. A. Smolka, Equivalences, congruences, and complete axiomatizations for probabilistic processes, Proc. of CONCUR, pp.367-383, 1990.
DOI : 10.1007/BFb0039071

R. M. Keller, Formal verification of parallel programs, Communications of the ACM, vol.19, issue.7, pp.371-384, 1976.
DOI : 10.1145/360248.360251

M. Kwiatkowska and G. Norman, A Testing Equivalence for Reactive Probabilistic Processes, Proc. of EXPRESS, pp.114-132, 1998.
DOI : 10.1016/S1571-0661(04)00121-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

N. A. Lynch, R. Segala, and F. Vaandrager, Compositionality for Probabilistic Automata, Proc. of CONCUR, pp.208-221, 2003.
DOI : 10.1007/978-3-540-45187-7_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.2484

R. Milner, Communication and Concurrency, 1989.

I. Phillips, Refusal testing, Theoretical Computer Science, vol.50, issue.3, pp.241-284, 1987.
DOI : 10.1016/0304-3975(87)90117-4
URL : http://doi.org/10.1016/0304-3975(87)90117-4

M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1994.
DOI : 10.1002/9780470316887

R. Segala, Modeling and Verification of Randomized Distributed Real-Time Systems, 1995.

R. Segala, A compositional trace-based semantics for probabilistic automata, Proc. of CONCUR, pp.234-248, 1995.
DOI : 10.1007/3-540-60218-6_17

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. Yi and K. G. Larsen, Testing Probabilistic and Nondeterministic Processes, Proc. of PSTV, pp.47-61, 1992.
DOI : 10.1016/B978-0-444-89874-6.50010-6