R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

E. Badouel, M. A. Bednarczyk, A. M. Borzyszkowski, B. Caillaud, and P. Darondeau, Concurrent secrets. Discrete Event Dynamic Systems, pp.425-446, 2007.
DOI : 10.1109/wodes.2006.1678407
URL : https://hal.archives-ouvertes.fr/inria-00070249

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

J. Bryans, M. Koutny, L. Mazaré, and P. Y. Ryan, Opacity generalised to transition systems, FAST 2005, pp.81-95, 2006.
DOI : 10.1007/s10207-008-0058-x
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKMR-fast05.pdf

F. Cassez, J. Dubreil, and H. Marchand, Synthesis of opaque systems with static and dynamic masks. Formal Methods in System Design, pp.88-115, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00662539

K. Chatterjee and L. Doyen, The Complexity of Partial-Observation Parity Games, LPAR'10, pp.1-14, 2010.
DOI : 10.1007/978-3-642-59126-6_7

J. A. Goguen and J. Meseguer, Security Policies and Security Models, 1982 IEEE Symposium on Security and Privacy, pp.11-20, 1982.
DOI : 10.1109/SP.1982.10014

E. Grädel and W. Thomas, Automata Logics, and Infinite Games : A Guide to Current Research, LNCS, vol.2500, 1998.
DOI : 10.1007/3-540-36387-4

J. Ouaknine and J. Worrell, On the language inclusion problem for timed automata: Closing a decidability gap, LICS 2004, pp.54-63, 2004.

J. H. Reif, Universal games of incomplete information, Proceedings of the eleventh annual ACM symposium on Theory of computing , STOC '79, 1979.
DOI : 10.1145/800135.804422

A. Sabelfeld and A. C. Myers, Language-based information-flow security, IEEE Journal on Selected Areas in Communications, vol.21, issue.1, pp.5-19, 2003.
DOI : 10.1109/JSAC.2002.806121
URL : http://www.cs.cornell.edu/andru/papers/jsac/sm-jsac03.pdf

J. Walter and . Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comput. Syst. Sci, vol.4, issue.2, pp.177-192, 1970.

U. Zwick and M. S. Paterson, The complexity of mean payoff games, International Computing and Combinatorics Conference, pp.1-10, 1995.
DOI : 10.1007/BFb0030814