K. Altisen, G. Gössler, 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

K. Altisen, G. Gössler, and J. Sifakis, A Methodology for the Construction of Scheduled Systems, 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'00, pp.106-120, 2000.
DOI : 10.1007/3-540-45352-0_11

K. Altisen, G. Gössler, and J. Sifakis, Scheduler modelling based on the controller synthesis paradigm, Real-Time Systems, vol.23, issue.1/2, pp.55-84, 2002.
DOI : 10.1023/A:1015346419267

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, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P. Ho et al., The algorithmic analysis of hybrid systems, Theoretical Computer Science, vol.138, issue.1, pp.3-34, 1995.
DOI : 10.1016/0304-3975(94)00202-T

R. Alur, T. A. Henzinger, and P. Ho, Automatic symbolic verification of embedded systems, IEEE Transactions on Software Engineering, vol.22, issue.3, pp.181-201, 1996.
DOI : 10.1109/32.489079

A. Arnold, Finite Transition System, 1994.

T. Aura and J. Lilius, A causal semantics for time Petri nets, Theoretical Computer Science, vol.243, issue.1-2, 2000.
DOI : 10.1016/S0304-3975(99)00114-0

S. Bardin, A. Finkel, J. Leroux, and L. Petrucci, FAST: Fast Acceleration of Symbolic Transition Systems, Proceedings of the 15th International Conference on Computer Aided Verification (CAV'03, pp.118-121, 2003.
DOI : 10.1007/978-3-540-45069-6_12
URL : https://hal.archives-ouvertes.fr/hal-00084185

B. Berthomieu and M. Diaz, Modeling and verification of time dependent systems using time Petri nets, IEEE Transactions on Software Engineering, vol.17, issue.3, pp.259-273, 1991.
DOI : 10.1109/32.75415

B. Berthomieu and M. Menasche, An enumerative approach for analyzing time Petri nets, IFIP Congress Series 9, pp.41-46, 1983.

B. Berthomieu, D. Lime, O. H. Roux, and F. Vernadat, Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches, Discrete Event Dynamic Systems, vol.74, issue.2, pp.133-158, 2007.
DOI : 10.1007/s10626-006-0011-y
URL : https://hal.archives-ouvertes.fr/hal-00489016

P. Brémond-grégoire, I. Lee, and R. Gerber, ACSR: An algebra of communicating shared resources with dense time and priorities, 4th International Conference on Concurrency Theory (CONCUR'93, pp.417-431, 1993.
DOI : 10.1007/3-540-57208-2_29

G. Bucci, A. Fedeli, L. Sassoli, and E. Vicario, Modeling flexible real time systems with preemptive time Petri nets, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings., pp.279-286, 2003.
DOI : 10.1109/EMRTS.2003.1212753

G. Bucci, A. Fedeli, L. Sassoli, and E. Vicario, Timed state space analysis of real-time preemptive systems, IEEE Transactions on Software Engineering, vol.30, issue.2, pp.97-111, 2004.
DOI : 10.1109/TSE.2004.1265815

F. Cassez and K. G. Larsen, The Impressive Power of Stopwatches, 11th International Conference on Concurrency TheoryCONCUR'2000) (Catuscia Palamidesi number 1877 In: LNCS, pp.138-152, 2000.
DOI : 10.1007/3-540-44618-4_12

F. Cassez and O. H. Roux, Structural translation from Time Petri Nets to Timed Automata, Journal of Systems and Software, vol.79, issue.10, pp.1456-1468, 2006.
DOI : 10.1016/j.jss.2005.12.021
URL : https://hal.archives-ouvertes.fr/hal-00139236

G. B. Dantzig, Linear programming and extensions, IEICE Transactions on Information and Systems, 1963.
DOI : 10.1515/9781400884179

C. Daws and S. Yovine, Reducing the number of clock variables of timed automata, 17th IEEE Real-Time Systems Symposium, pp.73-81, 1996.
DOI : 10.1109/REAL.1996.563702

D. L. Dill, Timing assumptions and verification of finite-state concurrent systems, pp.197-212, 1989.
DOI : 10.1007/3-540-52148-8_17

E. Fersman and W. Yi, A generic approach to schedulability analysis of real time tasks, Nordic J. of Computing, vol.11, issue.2, pp.129-147, 2004.

E. Fersman, L. Mokrushin, P. Pettersson, and W. Yi, Schedulability Analysis Using Two Clocks, 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.224-239, 2003.
DOI : 10.1007/3-540-36577-X_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.555.710

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

E. Fersman, P. Petterson, and W. Yi, Timed Automata with Asynchronous Processes: Schedulability and Decidability, 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), 2002.
DOI : 10.1007/3-540-46002-0_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.8710

G. Gardey, D. Lime, M. Magnin, and O. H. Roux, Romeo: A Tool for Analyzing Time Petri Nets, 17th International Conference on Computer Aided Verification (CAV 2005) (, pp.418-423, 2005.
DOI : 10.1007/11513988_41
URL : https://hal.archives-ouvertes.fr/hal-00523596

G. Gardey, O. H. Roux, and O. F. Roux, State space computation and analysis of time Petri nets. Theory and Practice of Logic Programming (TPLP). Special Issue on Specification Analysis and Verification of, Reactive Systems, vol.6, issue.3, pp.301-320, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00489232

M. G. Harbour, M. H. Klein, and J. P. Lehoczky, Fixed priority scheduling periodic tasks with varying execution priority, [1991] Proceedings Twelfth Real-Time Systems Symposium, pp.116-128, 1991.
DOI : 10.1109/REAL.1991.160365

T. A. Henzinger, P. Ho, and H. Wong-toi, HYTECH: a??model checker for hybrid systems, International Journal on Software Tools for Technology Transfer, vol.1, issue.1-2, pp.110-122, 1997.
DOI : 10.1007/s100090050008

T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic model checking for real-time systems, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.193-244, 1994.
DOI : 10.1109/LICS.1992.185551

P. Hladik and A. Déplanche, Analyse d'ordonnançabilité de tâches tempsréel avec offset et gigue, 11th international Conference on Real-Time Systems (RTS'03), 2003.

K. G. Larsen, P. Pettersson, and W. Yi, Model-checking for real-time systems, pp.62-88, 1995.
DOI : 10.1007/3-540-60249-6_41

D. Lime and O. H. Roux, Expressiveness and analysis of scheduling extended time Petri nets, 5th IFAC International Conference on Fieldbus Systems and their Applications, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00523586

D. Lime and O. H. Roux, A Translation Based Method for the Timed Analysis of Scheduling Extended Time Petri Nets, 25th IEEE International Real-Time Systems Symposium, pp.187-196, 2004.
DOI : 10.1109/REAL.2004.9
URL : https://hal.archives-ouvertes.fr/hal-00523591

D. Lime and O. H. Roux, Model Checking of Time Petri Nets Using the State Class Timed Automaton, Discrete Event Dynamic Systems, vol.1, issue.1???2, pp.179-205, 2006.
DOI : 10.1007/s10626-006-8133-9
URL : https://hal.archives-ouvertes.fr/hal-00488957

D. Lime and O. H. Roux, V??rification formelle des syst??mes temps-r??el avec ordonnancement pr??emptif, Techniques et sciences informatiques, vol.25, issue.3, pp.347-375, 2006.
DOI : 10.3166/tsi.25.343-370

C. Liu and J. W. Layland, Scheduling algorithms for multiprogramming in a hard real-time environment, Journal of ACM, vol.20, issue.1, pp.44-61, 1973.

M. Magnin, D. Lime, and O. H. Roux, An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches, 3rd International Workshop on Software Model-Checking of Electronic Notes in Theoretical Computer Science, pp.59-77, 2005.
DOI : 10.1016/j.entcs.2006.01.005
URL : https://hal.archives-ouvertes.fr/hal-00523595

J. Mcmanis and P. Varaiya, Suspension automata: A decidable class of hybrid automata, 6th International Conference on Computer Aided Verification (CAV'94) (David L. Dill, pp.105-117, 1994.
DOI : 10.1007/3-540-58179-0_47

P. M. Merlin, A Study of the Recoverability of Computing Systems, 1974.

Y. Okawa and T. Yoneda, Verification of schedulability of real-time systems with extended time Petri nets, Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems, pp.148-156, 1996.
DOI : 10.1109/WPDRTS.1995.470489

G. Osek, OSEK/VDX specification, 2001.

J. C. Palencia and M. G. Harbour, Schedulability analysis for tasks with static and dynamic offsets, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279), 1998.
DOI : 10.1109/REAL.1998.739728

J. C. Palencia and M. G. Harbour, Exploiting precedence relations in the scheduling analysis of distributed real-time systems, 20th IEEE Real-Time Systems Symposium (RTSS'99, pp.328-339, 1999.

O. H. Roux and A. Déplanche, A t-time Petri net extension for real time-task scheduling modeling, European Journal of AutomationJESA), vol.36, issue.7, pp.973-987, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00489238

O. H. Roux and D. Lime, Time Petri Nets with Inhibitor Hyperarcs. Formal Semantics and State Space Computation, Lecture Notes in Computer Science, vol.3099, pp.371-390, 2004.
DOI : 10.1007/978-3-540-27793-4_21
URL : https://hal.archives-ouvertes.fr/hal-00523590

K. Tindell, Fixed priority scheduling of hard real-time systems, 1994.