M. Andres, C. Palamidessi, P. Van-rossum, and A. Sokolova, Information hiding in probabilistic concurrent systems, Proc. of the 7th International Conference on Quantitative Evaluation of SysTems (QEST '10), 2010.
URL : https://hal.archives-ouvertes.fr/hal-00548187

C. Baier, N. Bertrand, and M. Grösser, On Decision Problems for Probabilistic B??chi Automata, Proc. of the 11th International Conference on Foundations of Software Science and Computation Structures, pp.287-301, 2008.
DOI : 10.1007/978-3-540-78499-9_21

C. Baier and M. Grösser, Recognizing ?-regular Languages with Probabilistic Automata, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.137-146, 2005.
DOI : 10.1109/LICS.2005.41

C. Baier, M. Grösser, and F. Ciesinski, 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, M. Größer, and F. Ciesinski, Model checking linear time properties of probabilistic systems. Handbook of Weighted Automata, pp.519-570, 2009.

C. Baier, M. Größer, and F. Ciesinski, Quantitative Analysis under Fairness Constraints, Proc. 7th International Symposium on Automated Technology for Verification and Analysis (ATVA), pp.135-150, 2009.
DOI : 10.1007/978-3-642-04761-9_12

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

A. Bianco and L. De-alfaro, Model checking of probabilistic and nondeterministic systems, Proc. of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp.499-513, 1995.
DOI : 10.1007/3-540-60692-0_70

A. R. Cassandra, A survey of POMDP applications. Presented at the AAAI Fall Symposium, 1998.

R. Chadha, P. Sistla, and M. Viswanathan, Power of Randomization in Automata on Infinite Strings, Proc. 20th International Conference on Concurrency Theory, pp.229-243, 2009.
DOI : 10.1016/S0019-9958(63)90290-0

K. Chatterjee, L. Doyen, and T. Henzinger, Qualitative analysis of patiallyobservable markov decision processes, Proc. Mathematical Foundation of Computer Science, 2010.

L. Cheung, N. Lynch, R. Segala, and F. Vaandrager, Switched PIOA: Parallel composition via distributed scheduling, Theoretical Computer Science, vol.365, issue.1-2, pp.83-108, 2006.
DOI : 10.1016/j.tcs.2006.07.033

URL : http://doi.org/10.1016/j.tcs.2006.07.033

C. Courcoubetis and M. Yannakakis, The complexity of probabilistic verification, Journal of the ACM, vol.42, issue.4, pp.857-907, 1995.
DOI : 10.1145/210332.210339

P. R. and P. Niebert, Partial order reduction on concurrent probabilistic programs, Proc. of the First International Conference on Quantitative Evaluation of SysTems (QEST), pp.240-249, 2004.

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

L. De-alfaro, The verification of probabilistic systems under memoryless partialinformation policies is hard, Proc. of the 2nd International Workshop on Probabilistic Methods in Verification (ProbMiV '99), pp.19-32, 1999.

S. Giro, P. D. Argenio, L. María-ferrer, and . Fioriti, Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers, Proc. 20th International Conference on Concurrency Theory, pp.338-353, 2009.
DOI : 10.1007/s10009-004-0140-2

S. Giro and P. R. , Quantitative Model Checking Revisited: Neither Decidable Nor Approximable, Proc. of the 5th International Conference on Formal Modelling and Analysis of Timed Systems, pp.179-194, 2007.
DOI : 10.1007/978-3-540-75454-1_14

M. Kwiatkowska, G. Norman, and D. Parker, Probabilistic symbolic model checking with PRISM: a hybrid approach, International Journal on Software Tools for Technology Transfer, vol.24, issue.2, pp.128-142, 2004.
DOI : 10.1007/s10009-004-0140-2

M. Littman, Algorithms for Sequential Decision Making, 1996.

O. Madani, S. Hanks, and A. Condon, On the undecidability of probabilistic planning and related stochastic optimization problems, Artificial Intelligence, vol.147, issue.1-2, pp.5-34, 2003.
DOI : 10.1016/S0004-3702(02)00378-8

G. Monahan, State of the Art???A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms, Management Science, vol.28, issue.1, pp.1-16, 1982.
DOI : 10.1287/mnsc.28.1.1

M. Mundhenk, J. Goldsmith, C. Lusena, and E. Allender, Complexity of finite-horizon Markov decision process problems, Journal of the ACM, vol.47, issue.4, pp.681-720, 2000.
DOI : 10.1145/347476.347480

C. Papadimitriou and J. Tsitsiklis, The Complexity of Markov Decision Processes, Mathematics of Operations Research, vol.12, issue.3, 1987.
DOI : 10.1287/moor.12.3.441

A. Paz, Introduction to probabilistic automata, 1971.

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

J. H. Reif, The complexity of two-player games of incomplete information, Journal of Computer and System Sciences, vol.29, issue.2, pp.274-301, 1984.
DOI : 10.1016/0022-0000(84)90034-5

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

W. Thomas, Languages, Automata, and Logic, Handbook of Formal Languages, pp.389-455, 1997.
DOI : 10.1007/978-3-642-59126-6_7

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

M. Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.327-338, 1985.
DOI : 10.1109/SFCS.1985.12

M. Y. Vardi and P. Wolper, An automata-theoretic approach to automatic program verification, Proc. of the 1st IEEE Symposium on Logic in Computer Science (LICS), pp.332-345, 1986.