G. Lowe, Towards a completeness result for model checking of security protocols, Journal of Computer Security, vol.7, issue.2-3, pp.89-146, 1999.
DOI : 10.3233/JCS-1999-72-302

B. Blanchet, M. Abadi, and C. Fournet, Automated Verification of Selected Equivalences for Security Protocols, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.331-340, 2005.
DOI : 10.1109/LICS.2005.8

N. Hadj-alouane, S. Lafrance, F. Lin, J. Mullins, and M. Yeddes, On the Verification of Intransitive Noninterference in Mulitlevel Security, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.35, issue.5, pp.948-957, 2005.
DOI : 10.1109/TSMCB.2005.847749

F. B. Schneider, Enforceable security policies, ACM Transactions on Information and System Security, vol.3, issue.1, pp.30-50, 2000.
DOI : 10.1145/353323.353382
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.1853

J. Ligatti, L. Bauer, and D. Walker, Edit automata: enforcement mechanisms for run-time security policies, International Journal of Information Security, vol.3, issue.1-2, pp.2-16, 2005.
DOI : 10.1007/s10207-004-0046-8

V. Darmaillacq, J. C. Fernandez, R. Groz, L. Mounier, and J. L. Richier, Test Generation for Network Security Rules, LNCS, vol.3964, 2006.
DOI : 10.1007/11754008_22

L. Guernic and G. , Information flow testing -the third path towards confidentiality guarantee, In: Advances in Computer Science LNCS, vol.4846, pp.33-47, 2007.

J. Dubreil, T. Jéron, and H. Marchand, Monitoring information flow by diagnosis techniques, 1901.
URL : https://hal.archives-ouvertes.fr/inria-00312747

J. Bryans, M. Koutny, L. Mazaré, and P. Ryan, Opacity generalised to transition systems, International Journal of Information Security, vol.79, issue.3???4, pp.421-435, 2008.
DOI : 10.1007/s10207-008-0058-x

R. Alur, P. Cern´ycern´y, and S. Zdancewic, Preserving Secrecy Under Refinement, ICALP '06: Proceedings (Part II) of the 33rd International Colloquium on Automata, Languages and Programming, pp.107-118, 2006.
DOI : 10.1007/11787006_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.322

E. Badouel, M. Bednarczyk, A. Borzyszkowski, B. Caillaud, and P. Darondeau, Concurrent Secrets, Discrete Event Dynamic Systems, vol.5, issue.4, pp.425-446, 2007.
DOI : 10.1007/s10626-007-0020-5
URL : https://hal.archives-ouvertes.fr/inria-00070249

J. Dubreil, P. Darondeau, and H. Marchand, Opacity enforcing control synthesis, 2008 9th International Workshop on Discrete Event Systems, pp.28-35, 2008.
DOI : 10.1109/WODES.2008.4605918
URL : https://hal.archives-ouvertes.fr/inria-00344269

J. Dubreil, P. Darondeau, and H. Marchand, Opacity enforcing control synthesis, 2008 9th International Workshop on Discrete Event Systems, 1921.
DOI : 10.1109/WODES.2008.4605918
URL : https://hal.archives-ouvertes.fr/inria-00344269

S. Takai and Y. Oka, A Formula for the Supremal Controllable and Opaque Sublanguage Arising in Supervisory Control, SICE Journal of Control, Measurement, and System Integration, vol.1, issue.4, pp.307-312, 2008.
DOI : 10.9746/jcmsi.1.307

F. Cassez and S. Tripakis, Fault diagnosis with static or dynamic diagnosers, Fundamenta Informatica, vol.88, issue.4, pp.497-540, 2008.

F. Cassez, J. Dubreil, and H. Marchand, Dynamic Observers for the Synthesis of Opaque Systems, 1930.
DOI : 10.1007/978-3-642-04761-9_26
URL : https://hal.archives-ouvertes.fr/inria-00399229

L. J. Stockmeyer and A. R. Meyer, Word problems requiring exponential time(Preliminary Report), Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.1-9, 1973.
DOI : 10.1145/800125.804029
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.4618

R. Alur, P. Cern´ycern´y, and S. Chaudhuri, Model Checking on Trees with Path Equivalences, LNCS, vol.4424, pp.664-678, 2007.
DOI : 10.1007/978-3-540-71209-1_51

D. A. Martin, Borel Determinacy, The Annals of Mathematics, vol.102, issue.2, pp.363-371, 1975.
DOI : 10.2307/1971035

W. Thomas, On the synthesis of strategies in infinite games, Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS'95, pp.1-13, 1995.
DOI : 10.1007/3-540-59042-0_57

R. Karp, A characterization of the minimum cycle mean in a digraph, Discrete Mathematics, vol.23, issue.1, pp.309-311, 1978.
DOI : 10.1016/0012-365X(78)90078-X

U. Zwick and M. Paterson, The complexity of mean payoff games on graphs, Theoretical Computer Science, vol.158, issue.1-2, pp.1-2, 1996.
DOI : 10.1016/0304-3975(95)00188-3