A. Beck and M. Teboulle, Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints, SIAM Journal on Optimization, vol.11, issue.1, pp.179-188, 2000.
DOI : 10.1137/S1052623498336930

A. Tarski, A Decision Method for Elementary Algebra and Geometry, 1951.
DOI : 10.1007/978-3-7091-9459-1_3

A. Tornambé, Discrete-Event System Theory, An Introduction, Copiright@1995

A. Seidenberg, A New Decision Method for Elementary Algebra, The Annals of Mathematics, vol.60, issue.2, p.374, 1954.
DOI : 10.2307/1969640

A. Strzebonski, Solving Systems of Strict Polynomial Inequalities, Journal of Symbolic Computation, vol.29, issue.3, p.480, 2000.
DOI : 10.1006/jsco.1999.0327

B. and D. Schutter, Max-Algebraic System Theory for Discrete Event Systems PhD thesis, Faculty of Applied Sciences, K.U.Leuven, 1996.

C. W. Brown, Guaranteed solution formula construction, Proceedings of the 1999 international symposium on Symbolic and algebraic computation , ISSAC '99, pp.137-144, 1999.
DOI : 10.1145/309831.309890

C. W. Brown, Improved projection for cylindrical algebraic decomposition. Accepted for publication in the Journal of Symbolic Computation, 2001.

C. W. Brown, Solution Formula Construction for Truth Invariant CAD's, p.99

C. G. Cassandras, S. Lafortune, and G. L. Olsder, ¨ Introduction to the modelling, control and optimization of discrete event system,¨ in Trends in Control, pp.217-291, 1995.

D. Kelley, Teoría de Automatas y Lenguajes Formales, 1995.

D. Yu, Grigor'ev. The complexity of deciding tarski algebra, Journal of Symbolic Computation, vol.5, p.108, 1988.

J. H. Davenport and J. Heintz, Real quantifier elimination is doubly exponential, Journal of Symbolic Computation, vol.5, issue.1-2, p.35, 1997.
DOI : 10.1016/S0747-7171(88)80004-X
URL : http://doi.org/10.1016/s0747-7171(88)80004-x

G. David and . Luenberger, Optimization by Vector Methods

E. Sontag, F. Bocelli, G. Cohen, G. L. Olsder, and J. P. Quadrat, Mathematical Control Theory, 1992.
DOI : 10.1007/978-1-4684-0374-9

M. J. Fischer and M. O. Rabin, Super-exponential complexity of Pressburger arithmetic, Complexity of Computation (AMS-SIAM Proceedings), vol.7, p.41, 1974.

F. Szigeti and J. Cardillo, Secuencia optima de instrucciones en Lenguajes Formales usando el principio de mínimo de Pontriaguin, 1997.

F. Szigeti, G. De-sarrazin, and J. Cardillo, Computer aided problem solving via optimization, Risc-Linz Report series number 99-13, 1999.

G. Cohen, D. Dubois, J. P. Quadrat, and M. Viot, A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing, IEEE Transactions on Automatic Control, vol.30, issue.3, pp.210-220, 1985.
DOI : 10.1109/TAC.1985.1103925

G. E. Collins, Quantifier elimination for real closed fields by cylindrical algebraic decompostion, In Lecture Notes In Computer Science, vol.33, pp.134-183, 1975.
DOI : 10.1007/3-540-07407-4_17

G. Cohen, Diods and discrete event systems, proceeding of the 11 th International Conference on Analysis and Optimizationod Systems of Lecture Notes in Control and Information Sciences, pp.223-236, 1994.

G. De-sarrazin, J. Cardillo, and F. Szigeti, Optimal Solution of a Computer Task, Non Linear Análisis, pp.47-1549, 2001.

H. Hong, An improvement of the projection operator in cylindrical algebraic decomposition, Proc. International Symposium on Symbolic and Algebraic Computation, pp.261-264, 1990.

H. Hong, Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination, Proc. International Symposium on Symbolic and Algebraic Computation, pp.177-188, 1992.

H. Hong, Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants, The Computer Journal, vol.36, issue.5, p.449, 1993.
DOI : 10.1093/comjnl/36.5.439

H. Hong, R. Liska, and S. Steinberg, Testing Stability by Quantifier Elimination, Journal of Symbolic Computation, vol.24, issue.2, 1997.
DOI : 10.1006/jsco.1997.0121

J. J. Cardillo-albarrán, Optimización de sistemas a Eventos discretos usando el principio de mínimo de Pontryagin, Thesis Msd, 1994.

J. J. Cardillo-albarrán and F. Szigeti, A symbolic algorithm for the optimization of integer processes over finite state space, International Congress on Industrial and Applied Mathematics, ICIAM 95, pp.3-7, 1995.

J. Cardillo and F. Szigeti, Inteligencia Artificial : Enfoque Linguistico usando el Principio de Mínimo de Pontriaguin, IV Jornadas de Control

J. Cardillo and E. Chacon, Un modelo de automatización integrada en procesos continuos, IV Jornadas Científico técnicas Facultad de Ingeniería, pp.468-473, 1998.

Y. Miranda and J. Cardillo, Evaluación de metodología para automatización integrada en la primera etapa de blanqueo de sebo, IV Jornadas Científico técnicas Facultad de Ingeniería, pp.316-322, 1998.

J. Cardillo and F. Szigeti, Optimización de sistemas a eventos discretos por desigualdades variacionales. I Coloquio de Automatizacion y Control, 1999.

J. Cardillo and F. Szigeti, Discrete event optimization by inequalities, COMPUTERS AND COMPUTATIONAL ENGINEERING IN CONTROL, pp.150-157, 1999.

J. Calderón, J. , E. Chacón, E. , L. Becerra et al., Gas process automation in petroleum production

J. Cardillo and F. Szigeti, Discrete event optimisation by inequalities, IEEE CSCC'99 International multiconference, 1999.

G. De-sarrazin, J. Cardillo, and F. Szigeti, Optimal solution task, World Congres of Nonlinear Analysts, 2000.

J. Cardillo and F. Szigeti, Symbolic Computation in Discrete Event Dynamical System Optimization, Congress of Nonlinear Analysts, 2000.

J. Cardillo and F. Szigeti, Optimización de Sistemas a Eventos Discretos, Charla Plenaria en las I Jornadas de Investigación de Operaciones, 2000.

J. Cardillo, E. Chacón, and R. Rivas, Autómatas Jerárquicos Comunicantes en Complejos de Producción Continua, II Coloquio de Auomatización y Control, CAC'00, pp.135-143, 2000.

J. Cardillo, F. Szigeti, J. C. Hennet, and J. Calvet, Symbolic Computation in Discrete Optimization, LAAS report , submitted to Journal of Symbolic Computation, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00860390

J. Cardillo, F. Sizgeti, J. C. Hennet, and J. L. Calvet, Programación Dinámica y cálculo formal, propuesta parámetrica para sistemas a eventos discretos, 2001.

J. Cardillo, E. Chacón, and C. Briceño, SIOp, Propuesta de sistemas de información operaciones para procesos de producción continua. III Coloquio de Automatización y Control CAC, 2001.

J. Cardillo, F. Szigeti, J. L. Calvet, and J. C. Hennet, Parametric Dynamic Programming for discrete Event System

J. Cardillo, F. Szigeti, J. Calvet, and J. Hennet, Parametric Dynamic Programming for discrete event systems, 10 th IEEE Mediterranean Conference on Control and Automation, 2002.

J. Cardillo, F. Szigeti, J. C. Hennet, and J. L. Calvet, Modélisation algébrique, pour l'optimisation de systèmes a événements discrets, 4 e Conférence Francophone de Modélisation et SIMulation, Organisation et Conduite d'Activités dans l'Industrie et les Services, MOSIM'03, 2003.

J. L. Gimenez, Contribition a la decomposition de systemes interconectes par programmation dynamique non seriellle. Application a des systemes de puissance, 1989.

J. Heintz, M. Roy, and P. Solernó, Sur la complexit?? du principe de Tarski-Seidenberg, Bulletin de la Société mathématique de France, vol.118, issue.1, p.126, 1990.
DOI : 10.24033/bsmf.2138
URL : http://archive.numdam.org/article/BSMF_1990__118_1_101_0.pdf

J. B. Lasserre, An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs, Rapport LAAS No00475 8th International Conference on Integer Programming and Combinatorial Optimization (IPCO'VIII), pp.13-15, 2001.
DOI : 10.1007/3-540-45535-3_23

J. B. Lasserre, T. Prieto, . Sdp, and . Vs, SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems, Stochastic Models, vol.17, issue.4, p.16, 2003.
DOI : 10.1214/aos/1176325496

J. O. Moody and P. J. Antsaklis, Supervisory Control of Discrete Event Systems Using

J. L. Peterson, Petri Nets, ACM Computing Surveys, vol.9, issue.3, pp.223-252, 1977.
DOI : 10.1145/356698.356702

J. L. Peterson, Petri Net Theory and the Modeling of Systems, 1981.

J. Renegar, On the computational complexity and geometry of the first-order theory of the reals, parts I-III, Journal of Symbolic Computation, vol.13, p.352, 1992.

J. Warga, Relaxed variational problems, Journal of Mathematical Analysis and Applications, vol.4, issue.1, pp.111-128, 1962.
DOI : 10.1016/0022-247X(62)90033-1
URL : http://doi.org/10.1016/0022-247x(62)90033-1

J. Warga, Necessary conditions for minimum in relaxed variational problems, Journal of Mathematical Analysis and Applications, vol.4, issue.1, pp.129-145, 1962.
DOI : 10.1016/0022-247X(62)90034-3

J. Zabczyk, Mathematical Control Theory, An Introduction, 1992.

K. M. Passino and K. L. Burgess, Stability Analysis of Discrete Event Systems

L. Ben-naoum, R. Boel, L. Bongaerts, B. De-shutter, Y. Peng et al., Methologies form discrete event dynamical systems: A survey, Journal A, vol.36, issue.4, pp.3-14, 1995.

M. Boulehmi and M. , Mise en oeuvre et évaluation d'algorithmes d'optimisation et de commande optimale sur un système de cacul formel, 1999.

R. Michael, D. S. Garey, and . Johnson, Computer and Intractability: A Guide to the Theory of NP Completeness

M. C. Zhon and F. Dicesare, Petri Net Synthesis for Discrete Event Control of Manufacturing Systems, 1991.

N. Long, K. Shimoruma, C. , and M. Janvier, A New Poorf Of The Maximun Principle, Scientific Series, [OT89] Optimization Tutorial, optimization with an equality constraint: The envelope theorem, 2002.

P. J. Cohen, Decision procedures for real and p-adic fields. Comm. Pure and Applied Math, PI89] Proceeding of the IEEE Special issue on Dynamics of Discrete Systems, 1969.

P. Pedersen, M. Roy, and A. Szpirglas, Counting real zeros in the multivariate case, Proc. MEGA'92. Birkhäuser Boston, 1993.
DOI : 10.1007/978-1-4612-2752-6_15

R. Dautray and J. Lions, Analyse math\'ematique et calcul numerique pour le sciences et les techniques, 1984.

R. Dautray, J. Lions, ]. R. Kalman, P. L. Falb, and M. A. Arbib, Analyse Mathématique et calcul numérique pour les sciences et les techniques, Series Scientifique, Masson Topics in Mathemaical System Theory, pp.7-033255, 1984.

R. Larson, R. , and J. Casti, Principle of Dynamic Programming, Control and System Theory Part I and II. Marcel Dekker, 1978.

R. Weber and L. , Optimization and Control, 2002.

S. Mccallum, An improved projection operator for cylindrical algebraic decomposition, Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation, 1998.

J. Schwartz and M. Sharir, On thèpiano movers' problem. i. the case of a two-dimensional rigid polygonal body moving amidst polygonal barriers, 1981.

T. Murata, Petri nets: Properties, analysis and applications, Proceedings of the IEEE, vol.77, issue.4, pp.541-580, 1989.
DOI : 10.1109/5.24143

V. Weispfenning, The complexity of linear problems in fields, Journal of Symbolic Computation, vol.5, issue.1-2, p.27, 1988.
DOI : 10.1016/S0747-7171(88)80003-8

V. Weispfenning, Quantifier elimination for real algebra---the cubic case, Proceedings of the international symposium on Symbolic and algebraic computation , ISSAC '94, pp.258-263, 1994.
DOI : 10.1145/190347.190425

V. Weispfenning, Quantifier Elimination for Real Algebra -- the Quadratic Case and Beyond, Applicable Algebra in Engineering, Communication and Computing, vol.8, issue.2, p.101, 1997.
DOI : 10.1007/s002000050055

V. Weispfenning, A New Approach to Quantifier Elimination for Real Algebra, Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation, 1998.
DOI : 10.1007/978-3-7091-9459-1_20

Y. C. Ho, Discrete Event Dynamic Systems: Analyzing Complexity and Performance in the Modern World Piscataway, 1992.