K. Altisen, G. Gößler, A. Pnueli, J. Sifakis, S. Tripakis et al., A framework for scheduler synthesis, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054), pp.154-163, 1999.
DOI : 10.1109/REAL.1999.818838

R. Alur, A. Degorre, O. Maler, and G. Weiss, On Omega-Languages Defined by Mean-Payoff Conditions, Lecture Notes in Computer Science, vol.158, issue.1, pp.333-347, 2009.
DOI : 10.1016/0304-3975(95)00188-3

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

R. Alur and T. A. Henzinger, Logics and models of real time: A survey, REX Workshop, pp.74-106, 1991.
DOI : 10.1007/BFb0031988

R. Alur, A. Kanade, and G. Weiss, Ranking Automata and Games for Prioritized Requirements, Lecture Notes in Computer Science, vol.5123, pp.240-253, 2008.
DOI : 10.1007/978-3-540-70545-1_23

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.2283

E. Asarin, P. Caspi, and O. Maler, Timed regular expressions, Journal of the ACM, vol.49, issue.2, pp.172-206, 2002.
DOI : 10.1145/506147.506151

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.272

E. Asarin and A. Degorre, Volume and entropy of regular timed languages: Analytic approach. To appear in proceedings of FORMATS'09, 2009.

E. Asarin and A. Degorre, Volume and entropy of regular timed languages: Discretization approach. To appear in proceedings of Concur'09, 2009.

E. Asarin, O. Maler, and A. Pnueli, Symbolic controller synthesis for discrete and timed systems, Hybrid Systems II, pp.1-20, 1994.
DOI : 10.1007/3-540-60472-3_1

E. Asarin, O. Maler, and A. Pnueli, On discretization of delays in timed automata and digital circuits, CONCUR'98, pp.470-484
DOI : 10.1007/BFb0055642

E. Asarin and A. Pokrovskii, Use of the Kolmogorov complexity in analyzing control system dynamics, Automation and Remote Control, issue.1, pp.25-33, 1986.

M. Ramzi-ben-salah, O. Bozga, and . Maler, Compositional timing analysis, Proceedings of the seventh ACM international conference on Embedded software, EMSOFT '09, 2009.
DOI : 10.1145/1629335.1629342

N. Bertrand, P. Bouyer, T. Brihaye, and N. Markey, Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics, 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp.55-64, 2008.
DOI : 10.1109/QEST.2008.19

URL : https://hal.archives-ouvertes.fr/inria-00424518

J. Blazewicz, K. Ecker, E. Pesch, G. Schmidth, and J. Weglarz, Scheduling Computer and Manufacturing Processes, Journal of the Operational Research Society, vol.48, issue.6, 2001.
DOI : 10.1057/palgrave.jors.2600793

L. Bodin, B. Golden, A. Assad, and M. Ball, Routing and scheduling of vehicles and crews : The state of the art, Computers & OR, vol.10, issue.2, pp.63-211, 1983.

A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson, Adversarial queuing theory, Journal of the ACM, vol.48, issue.1, pp.13-38, 2001.
DOI : 10.1145/363647.363659

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.4618

A. A. Brudno, Entropy and the complexity of the trajectories of a dynamical system, Trans. Moscow Math. Soc, vol.44, pp.127-151, 1983.

G. Bucci, R. Piovosi, L. Sassoli, and E. Vicario, Introducing probability within state class analysis of dense-time-dependent systems, Second International Conference on the Quantitative Evaluation of Systems (QEST'05), pp.13-22, 2005.
DOI : 10.1109/QEST.2005.17

G. C. Buttazzo, Hard Real-Time Computing Systems: Predictable Schedulding Algorithms and Applications. Real-Time Systems Series, 2005.
DOI : 10.1007/0-387-27578-9

M. Caccamo, T. P. Baker, A. Burns, G. C. Buttazzo, and L. Sha, Real-Time Scheduling for Embedded Systems, Handbook of Networked and Embedded Control Systems, pp.173-196, 2005.
DOI : 10.1007/0-8176-4404-0_8

F. Cassez, A. David, E. Fleury, K. G. Larsen, and D. Lime, Efficient On-the-Fly Algorithms for the Analysis of Timed Games, In CONCUR, pp.66-80, 2005.
DOI : 10.1007/11539452_9

URL : https://hal.archives-ouvertes.fr/hal-00350475

K. Chatterjee, Concurrent games with tail objectives, Theoretical Computer Science, vol.388, issue.1-3, pp.181-198, 2007.
DOI : 10.1016/j.tcs.2007.07.047

URL : http://doi.org/10.1016/j.tcs.2007.07.047

K. Chatterjee, T. A. Luca-de-alfaro, and . Henzinger, The complexity of quantitative concurrent parity games, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.678-687, 2006.
DOI : 10.1145/1109557.1109631

K. Chatterjee, L. Doyen, and T. A. Henzinger, Quantitative languages, Proceedings of CSL 2008, 2008.
DOI : 10.1145/1805950.1805953

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.9296

K. Chatterjee, T. A. Henzinger, and M. Jurdzi´nskijurdzi´nski, Meanpayoff parity games, Proceedings of the 20th Annual Symposium on Logic in Computer Science, pp.178-187, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00766251

V. Cholvi and J. Echagüe, Stability of FIFO networks under adversarial models: State of the art, Computer Networks, vol.51, issue.15, pp.4460-4474, 2007.
DOI : 10.1016/j.comnet.2007.07.001

A. Darte, Y. Robert, and F. Vivien, Scheduling and Automatic Parallelization, 2000.
DOI : 10.1007/978-1-4612-1362-8

URL : https://hal.archives-ouvertes.fr/hal-00856645

A. Degorre and O. Maler, On Scheduling Policies for Streams of Structured Jobs, Lecture Notes in Computer Science, vol.5215, pp.141-154, 2008.
DOI : 10.1007/978-3-540-85778-5_11

H. El-rewini, Partitioning and scheduling, Parallel & Distributed Computed Handbook, chapter 9, pp.239-273, 1996.

E. Fersman, L. Mokrushin, P. Pettersson, and W. Yi, Schedulability analysis of fixed-priority systems using timed automata, Theoretical Computer Science, vol.354, issue.2, pp.301-317, 2006.
DOI : 10.1016/j.tcs.2005.11.019

C. Gan, P. Lin, N. Perng, T. Kuo, and C. Hsu, Scheduling for time-division based shared channel allocation for UMTS, Wireless Networks, vol.9, issue.2, pp.189-202, 2007.
DOI : 10.1007/s11276-006-4960-8

H. Gimbert and W. Zielonka, Deterministic Priority Mean-Payoff Games as Limits of Discounted Games, ICALP, pp.312-323, 2006.
DOI : 10.1007/11787006_27

URL : https://hal.archives-ouvertes.fr/hal-00160434

T. A. Henzinger, Z. Manna, and A. Pnueli, What good are digital clocks?, ICALP'92, pp.545-558, 1992.
DOI : 10.1007/3-540-55719-9_103

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.783

G. Hsu, A survey of queueing theory, Annals of Operations Research, vol.21, issue.2, pp.29-43, 1990.
DOI : 10.1007/BF02216814

A. Singh, J. , and S. Meeran, A state-of-the-art review of job-shop scheduling techniques, 1998.

G. Edward and . Coffman-jr, Computer and Job-Shop Scheduling Theory, 1976.

N. Andre¨?andre¨? and . Kolmogorov, Three approaches to the quantitative definition of information, Problems of Information Transmission, vol.1, issue.1, pp.1-7, 1965.

M. A. Krasnosel-'skij, E. A. Lifshits, and A. V. Sobolev, Positive Linear Systems: The method of positive operators, Number 5 in Sigma Series in Applied Mathematics . Heldermann Verlag, 1989.

O. Kupferman and Y. Lustig, Lattice Automata, Proc. 8th Intl. Conf. Verification, Model Checking, and Abstract Interpretation, pp.199-213, 2007.
DOI : 10.1007/978-3-540-69738-1_14

M. Li and P. Vitányi, An introduction to Kolmogorov complexity and its applications, 2008.

D. Lind and B. Marcus, An introduction to symbolic dynamics and coding, 1995.
DOI : 10.1017/CBO9780511626302

URL : http://dx.doi.org/10.1016/0898-1221(96)87345-7

C. Liu and J. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM, vol.20, issue.1, pp.46-61, 1973.
DOI : 10.1145/321738.321743

O. Maler, A. Pnueli, and J. Sifakis, On the synthesis of discrete controllers for timed systems (an extended abstract), STACS, pp.229-242, 1995.

Z. Manna and A. Pnueli, The temporal logic of reactive and concurrent systems: Specification, 1991.
DOI : 10.1007/978-1-4612-0931-7

D. Perrin and J. Pin, Infinite Words. Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol.141, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00620767

M. Pinedo, Planning and Scheduling in Manufacturing and Services. Springer Series in Operations Research and Financial Engineering, 2007.

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

C. Rojas, Computability and information in models of randomness and chaos, Mathematical Structures in Computer Science, vol.1443, issue.02, pp.291-307, 2008.
DOI : 10.1070/RM1983v038n04ABEH004203

L. Sassoli and E. Vicario, Close form derivation of state-density functions over DBM domains in the analysis of non-Markovian models, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007), pp.59-68, 2007.
DOI : 10.1109/QEST.2007.23

W. Thomas, Automata on Infinite Objects, pp.133-191, 1990.
DOI : 10.1016/B978-0-444-88074-1.50009-3

Y. Moshe, P. Vardi, and . Wolper, Reasoning about infinite computations, Information and Computation, vol.115, issue.1, pp.1-37, 1994.

H. Wong-toi and D. Dill, Synthesizing processes and schedulers from temporal specifications, CAV, pp.272-281, 1990.
DOI : 10.1007/BFb0023741

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

O. Dans-unepremì-ere-approche, . Une, . De, . Co?ut-moyen93-en-considérant, and . Qu, il est pertinent, ` a la place d'une valeur unique, d'´ etudier l'ensemble des valeurs d'adhérence de la suite des coûts moyens. Pour une exécution w sur un automate A, nous notons cet ensemble Acc A (w) 1 . Nous montrons, ce qui aura un rôle dans les résultats d'analysabilité, que Acc A(w) est une partie fermée

. Ainsi, acceptation d'une exécution w sur un automate A ` a une condition sur Acc A (w) Dans le cas le plus général, si F est un prédicat sur les parties de R d , nous disons que l'exécution w est acceptée sur A

. De and C. Si, son unique exécution sur A est acceptée, et nous appelons langage d'un automate A par la condition F , l'ensemble L(A, F ) des mots dont l'exécution est acceptée sur A par le prédicat F . Enfin, si d = 1, nous appelons condition de seuil tout prédicat F tel que F (S) ? extr S ?? C o` u extr ? {inf