L. D. Alfaro, Computing Minimum and Maximum Reachability Times in Probabilistic Systems, Proceedings of the 10th International Conference on Concurrency Theory, pp.66-81, 1999.
DOI : 10.1007/3-540-48320-9_7

C. Baier and M. Kwiatkowska, Model checking for a probabilistic branching time logic with fairness, Distributed Computing, vol.11, issue.3, pp.125-155, 1998.
DOI : 10.1007/s004460050046

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.915

D. P. Bertsekas and J. N. Tsitsiklis, An Analysis of Stochastic Shortest Path Problems, Mathematics of Operations Research, vol.16, issue.3, pp.580-595, 1991.
DOI : 10.1287/moor.16.3.580

L. De-alfaro, Formal Verification of Probabilistic Systems, 1998.

B. Delahaye, J. Katoen, K. Larsen, A. Legay, M. Pedersen et al., New Results on Abstract Probabilistic Automata, 2011 Eleventh International Conference on Application of Concurrency to System Design, pp.118-127, 2011.
DOI : 10.1109/ACSD.2011.10

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.9361

B. Delahaye, J. Katoen, K. G. Larsen, A. Legay, M. L. Pedersen et al., Abstract probabilistic automata, VMCAI. LNCS, pp.324-339, 2011.
DOI : 10.1007/978-3-642-18275-4_23

URL : https://hal.archives-ouvertes.fr/hal-01084342

M. Huth, R. Jagadeesan, and D. Schmidt, Modal Transition Systems: A Foundation for Three-Valued Program Analysis, ESOP. LNCS, pp.155-169, 2001.
DOI : 10.1007/3-540-45309-1_11

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.8685

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

J. Katoen, D. Klink, and M. R. Neuhäußer, Compositional Abstraction for Stochastic Systems, In: FORMATS. LNCS, vol.206, pp.195-211, 2009.
DOI : 10.1007/BFb0035395

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.8309

M. Kattenbelt, M. Z. Kwiatkowska, G. Norman, and D. Parker, A game-based abstraction-refinement framework for?Markov decision processes, Formal Methods in System Design, vol.58, issue.1?2, pp.246-280, 2010.
DOI : 10.1007/978-1-4684-9455-6

N. A. Lynch, R. Segala, and F. W. Vaandrager, Observing Branching Structure through Probabilistic Contexts, SIAM Journal on Computing, vol.37, issue.4, pp.977-1013, 2007.
DOI : 10.1137/S0097539704446487

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.2220

R. Milner, Communication and Concurrency, 1989.

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

R. Segala and N. A. Lynch, Probabilistic simulations for probabilistic processes, Nordic J. of Computing, vol.2, pp.250-273, 1995.
DOI : 10.1007/978-3-540-48654-1_35

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6430

M. Swaminathan, J. Katoen, and E. Olderog, Layered reasoning for randomized distributed algorithms, Formal Aspects of Computing, vol.78, issue.2, 2012.
DOI : 10.1007/BF03259394

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.379.8811