J. Baier and . Katoen, Principles of model checking, 2008.

O. Barak, R. Goldreich, S. Impagliazzo, A. Rudich, S. P. Sahai et al., On the (Im)Possibility of Obfuscating Programs, Proc. of CRYPTO'01, pp.1-18, 2001.

K. Bérard, N. Chatterjee, and . Sznajder, Probabilistic opacity for Markov decision processes, Information Processing Letters, vol.115, issue.1, pp.52-59, 2015.
DOI : 10.1016/j.ipl.2014.09.001

O. Bérard, J. Kouchnarenko, M. Mullins, and . Sassolas, Preserving opacity on Interval Markov Chains under simulation, 2016 13th International Workshop on Discrete Event Systems (WODES), pp.319-324, 2016.
DOI : 10.1109/WODES.2016.7497866

J. Bérard, M. Mullins, and . Sassolas, Quantifying opacity, Proc. of QEST'10, pp.263-272, 2010.

J. Bérard, M. Mullins, and . Sassolas, Quantifying opacity, Mathematical Structures in Computer Science, vol.12, issue.02, pp.361-403, 2015.
DOI : 10.1016/j.ic.2007.07.003

S. Bertrand, E. Haddad, and . Lefaucheux, Foundation of Diagnosis and Predictability in Probabilistic Systems, Proc. of FSTTCS'14 Leibniz-Zentrum für Informatik, pp.417-429, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01088117

L. Berwanger and . Doyen, On the power of imperfect information, Proc. of FSTTCS'08, 2008.

W. Bryans, M. Koutny, L. Mazaré, and P. Y. Ryan, Opacity generalised to transition systems, International Journal of Information Security, vol.79, issue.3???4, pp.421-435, 2008.
DOI : 10.1007/3-540-56689-9_45

L. Chatterjee, H. Doyen, T. A. Gimbert, and . Henzinger, Randomness for free, Proc. of MFCS'10, pp.246-257, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01006409

L. Chatterjee, T. A. Doyen, and . Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, Proc. of MFCS'10, pp.258-269, 2010.
DOI : 10.1007/978-3-642-15155-2_24

K. Chatterjee, T. A. Sen, and . Henzinger, Model-Checking omega-Regular Properties of Interval Markov Chains, Proc. of FOSSACS'08, pp.302-317, 2008.

Y. Gimbert and . Oualhadj, Probabilistic Automata on Finite Words: Decidable and Undecidable Problems, Proc. of ICALP'10, Part II, pp.527-538, 2010.
DOI : 10.1007/978-3-642-14162-1_44

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

R. Goubault-larrecq and . Segala, Random Measurable Selections, Horizons of the Mind. A Tribute to Prakash Panangaden, pp.343-362, 2014.
DOI : 10.1007/978-3-642-85473-6

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

J. D. Hughes and V. Shmatikov, Information hiding, anonymity and privacy: a modular approach, Journal of Computer Security, vol.12, issue.1, pp.3-36, 2004.
DOI : 10.3233/JCS-2004-12102

. Mazaré, Decidability of Opacity with Non-Atomic Keys, Proc. of FAST'04, pp.71-84, 2005.
DOI : 10.1007/0-387-24098-5_6

H. Papadimitriou and J. N. Tsitsiklis, The Complexity of Markov Decision Processes, Mathematics of Operations Research, vol.12, issue.3, pp.441-450, 1987.
DOI : 10.1287/moor.12.3.441

. Paz, Introduction to Probabilistic Automata, 1971.