F. Bourdoncle, Sémantiques des Langages Impératifs d'Ordre Supérieur et Interprétation Abstraite, 1992.

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

K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, Algorithms for omega-regular games of incomplete information, Logical Methods in Computer Science, vol.3, issue.3, 2007.

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-96, 1978.
DOI : 10.1145/512760.512770

N. Halbwachs, Y. E. Proy, and P. Roumanoff, Verification of realtime systems using linear relation analysis, Formal Methods in System Design, vol.11, issue.2, pp.157-185, 1997.
DOI : 10.1023/A:1008678014487

T. A. Henzinger, R. Majumdar, and J. Raskin, A classification of symbolic transition systems, ACM Transactions on Computational Logic, vol.6, issue.1, pp.1-32, 2005.
DOI : 10.1145/1042038.1042039

R. C. Hill, D. M. Tilbury, and S. Lafortune, Covering-based supervisory control of partially observed discrete event systems for state avoidance, 2008 9th International Workshop on Discrete Event Systems, 2008.
DOI : 10.1109/WODES.2008.4605914

L. E. Holloway, B. H. Krogh, and A. Giua, A survey of Petri net methods for controlled discrete event systems. Discrete Event Dynamic Systems: Theory and Application, pp.151-190, 1997.

B. Jeannet, Dynamic partitioning in linear relation analysis Application to the verification of reactive systems, Formal Methods in System Design, vol.23, issue.1, pp.5-37, 2003.
DOI : 10.1023/A:1024480913162

G. Kalyon, T. L. Gall, H. Marchand, and T. Massart, Control of infinite symbolic transition sytems under partial observation, Technical, vol.103, 2008.

R. Kumar, V. Garg, and S. I. Marcus, Predicates and predicate transformers for supervisory control of discrete event dynamical systems, IEEE Transactions on Automatic Control, vol.38, issue.2, pp.232-247, 1993.
DOI : 10.1109/9.250512

R. Kumar and V. K. Garg, On Computation of State Avoidance Control for Infinite State Systems in Assignment Program Framework, IEEE Transactions on Automation Science and Engineering, vol.2, issue.1, pp.87-91, 2005.
DOI : 10.1109/TASE.2004.829432

T. , L. Gall, B. Jeannet, and H. Marchand, Supervisory control of infinite symbolic systems using abstract interpretation, CDC/ECC'05, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00483925

P. J. Ramadge and W. M. Wonham, The control of discrete event systems, Proceedings of the IEEE, vol.77, issue.1, pp.81-98, 1989.
DOI : 10.1109/5.21072

S. Takai and S. Kodama, Characterization of all M-controllable subpredicates of a given predicate, International Journal of Control, vol.70, issue.4, pp.541-549, 1998.
DOI : 10.1080/002071798222190

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

W. M. Wonham and P. J. Ramadge, Modular supervisory control of discrete-event systems, Mathematics of Control, Signals, and Systems, vol.25, issue.1, pp.13-30, 1988.
DOI : 10.1007/BF02551233

G. Kalyon, Control of Infi nite Symbolic Transition Systems under Partial Observation MoC10