M. Kwiatkowska, G. Norman, D. Parker, and H. Qu, Assume-Guarantee Verification for Probabilistic Systems, Proc. of TACAS'10, pp.23-37, 2010.
DOI : 10.1007/978-3-642-12002-2_3
URL : https://hal.archives-ouvertes.fr/inria-00458058

V. Forejt, M. Kwiatkowska, G. Norman, D. Parker, and H. Qu, Quantitative Multi-objective Verification for Probabilistic Systems, Proc. of TACAS'11, pp.112-127, 2011.
DOI : 10.1007/978-3-642-12002-2_3
URL : https://hal.archives-ouvertes.fr/hal-00647055

A. Valmari, Stubborn sets for reduced state space generation, Proc. of the 10th International Conference on Application and Theory of Petri Nets, pp.491-515, 1989.
DOI : 10.1007/3-540-53863-1_36

P. Godefroid, Using partial orders to improve automatic verification methods, Proc. of CAV'90, pp.176-185, 1990.
DOI : 10.1007/BFb0023731

D. A. Peled, All from one, one for all: on model checking using representatives, Proc. of CAV'93, pp.409-423, 1993.
DOI : 10.1007/3-540-56922-7_34

K. Mcmillan and D. Probst, A technique of state space search based on unfolding, Formal Methods in System Design, vol.22, issue.12, 1995.
DOI : 10.1007/BF01384314

C. Baier, M. Grösser, and F. Cieinski, Partial order reduction for probabilistic systems, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings., pp.230-239, 2004.
DOI : 10.1109/QEST.2004.1348037

C. Baier, P. D. Argenio, and M. Grösser, Partial Order Reduction for Probabilistic Branching Time, Electronic Notes in Theoretical Computer Science, vol.153, issue.2, pp.97-116, 2006.
DOI : 10.1016/j.entcs.2005.10.034
URL : http://doi.org/10.1016/j.entcs.2005.10.034

P. R. and P. Niebert, Partial order reduction on concurrent probabilistic programs, QEST'04, pp.240-249, 2004.

C. Baier, M. Größer, and F. Ciesinski, Quantitative Analysis under Fairness Constraints, Proc. of ATVA'09), pp.135-150, 2009.
DOI : 10.1007/978-3-642-04761-9_12

M. Größer and C. Baier, Partial Order Reduction for Markov Decision Processes: A Survey, Proc. of FMCO'05, pp.408-427, 2005.
DOI : 10.1007/11804192_19

H. Hansen and X. Wang, Compositional Analysis for Weak Stubborn Sets, 2011 Eleventh International Conference on Application of Concurrency to System Design, 2011.
DOI : 10.1109/ACSD.2011.25

H. Hansson and B. Jonsson, A logic for reasoning about time and reliability, Formal Aspects of Computing, vol.2, issue.1, pp.512-535, 1994.
DOI : 10.1007/BF01211866

A. Bianco and L. De-alfaro, Model checking of probabilistic and nondeterministic systems, Proc. of FSTTCS'95, 1995.
DOI : 10.1007/3-540-60692-0_70

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

L. De-alfaro, Formal verification of probabilistic systems, 1997.

F. Ciesinski, C. Baier, M. Größer, and J. Klein, Reduction Techniques for Model Checking Markov Decision Processes, 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp.45-54, 2008.
DOI : 10.1109/QEST.2008.45

M. Kwiatkowska, D. Parker, and H. Qu, Incremental quantitative verification for Markov decision processes, 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN), 2011.
DOI : 10.1109/DSN.2011.5958249
URL : https://hal.archives-ouvertes.fr/hal-00647057

A. Valmari, More Stubborn Set Methods for Process Algebras, Proc. of POMIV'96, ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.213-231, 1997.
DOI : 10.1007/978-3-319-32582-8_16

A. Valmari, A stubborn attack on state explosion, Formal Methods in System Design, vol.31, issue.3, pp.297-322, 1992.
DOI : 10.1007/BF00709154

S. Evangelista and C. Pajault, Solving the ignoring problem for partial order reduction, International Journal on Software Tools for Technology Transfer, vol.1, issue.4, pp.155-170, 2010.
DOI : 10.1007/s10009-010-0137-y

A. Valmari, The state explosion problem, " in Lectures on Petri Nets I: Basic Models, pp.429-528, 1998.

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

E. Nuutila and E. Soisalon-soininen, On finding the strongly connected components in a directed graph, Information Processing Letters, vol.49, issue.1, pp.9-14, 1994.
DOI : 10.1016/0020-0190(94)90047-7

A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker, PRISM: A Tool for Automatic Verification of Probabilistic Systems, Proc. of TACAS'06, 2006.
DOI : 10.1007/11691372_29

M. Kwiatkowska, G. Norman, D. Parker, and J. Sproston, Performance analysis of probabilistic timed automata using digital clocks, 2006.