R. Alur, S. Pavol?ern´ypavol?pavol?ern´pavol?ern´y, and . 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, pp.425-44606, 2007.
DOI : 10.1109/wodes.2006.1678407
URL : https://hal.archives-ouvertes.fr/inria-00070249

R. D. Brandt, V. Garg, R. Kumar, F. Lin, S. I. Marcus et al., Formulas for calculating supremal controllable and normal sublanguages, Systems & Control Letters, vol.15, issue.2, pp.111-117, 1990.
DOI : 10.1016/0167-6911(90)90004-E

J. Bryans, M. Koutny, L. Mazaré, and P. Y. Ryan, Opacity generalised to transition systems

. Schneider, Revised Selected Papers of the 3rd International Workshop on Formal Aspects Irisa Opacity Enforcing Control Synthesis 17

C. Cassandras and S. Lafortune, Introduction to Discrete Event Systems, 1999.

J. Dubreil, T. Jéron, and H. Marchand, Construction de moniteurs pour la surveillance de propriétés de sécurité, 6` eme Colloque Francophone sur la Modélisation des Systèmes Réactifs, 2007.

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

L. Mazaré, Using unification for opacity properties, Proceedings of the 4th IFIP WG1

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

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285