Y. Abdedda¨?mabdedda¨?m, E. Asarin, M. Gallien, F. Ingrand, C. Lessire et al., Planning Robust Temporal Plans A Comparison Between CBTP and TGA Approaches, ICAPS. AAAI, 2007.

Y. Abdedda¨?mabdedda¨?m, E. Asarin, and O. Maler, On optimal scheduling under uncertainty, TACAS, pp.240-253, 2003.

Y. Abdedda¨?mabdedda¨?m, E. Asarin, and O. Maler, Scheduling with timed automata, Theor. Comput. Sci, vol.354, issue.2, 2006.

M. Ai-chang, J. Bresina, L. Charest, A. Jónsson, J. Hsu et al., MAPGEN: Mixed initiative planning and scheduling for the Mars 03 MER mission, ISAIRAS, 2003.

E. Asarin and A. Degorre, Volume and entropy of regular timed languages. HAL preprint hal-00369812, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00369812

G. Behrmann, A. Cougnard, A. David, E. Fleury, K. Larsen et al., UPPAAL-Tiga: Time for Playing Games!, LNCS, vol.4590, 2007.
DOI : 10.1007/978-3-540-73368-3_14
URL : https://hal.archives-ouvertes.fr/hal-00350466

J. Bengtsson, B. Jonsson, J. Lilius, and W. Yi, Partial order reductions for timed systems, In CONCUR LNCS, vol.1466, pp.485-500, 1998.
DOI : 10.1007/BFb0055643

F. Cassez, A. David, E. Fleury, K. Larsen, and D. Lime, Efficient On-the-Fly Algorithms for the Analysis of Timed Games, In CONCUR LNCS, vol.3653, 2005.
DOI : 10.1007/11539452_9
URL : https://hal.archives-ouvertes.fr/hal-00350475

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, 1997.

R. Dechter, I. Meiri, and J. Pearl, Temporal constraint networks, Artificial Intelligence, vol.49, issue.1-3, pp.61-95, 1991.
DOI : 10.1016/0004-3702(91)90006-6

A. Fehnker, Guiding and Cost-Optimality in Model Checking of Timed and Hybrid Systems, 2002.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

M. Ghallab and H. Laruelle, Representation and control in IxTeT, a temporal planner, AIPS, 1994.

E. Grädel, W. Thomas, and T. Wilke, Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, LNCS, vol.2500, 2001.
DOI : 10.1007/3-540-36387-4

T. Henzinger and P. Kopke, Discrete-time control for rectangular hybrid automata, Theoretical Computer Science, vol.221, issue.1-2, pp.369-392, 1999.
DOI : 10.1016/S0304-3975(99)00038-9

N. Laya¨?dalaya¨?da, L. Sabry-isma¨?lisma¨?l, and C. Roisin, Dealing with uncertain durations in synchronized multimedia presentations, Multimedia Tools and Applications, vol.18, issue.3, pp.213-231, 2002.
DOI : 10.1023/A:1019944800320

S. Lemai and F. Ingrand, Interleaving temporal planning and execution in robotics domains, AAAI, 2004.

X. Liu and S. Smolka, Simple linear-time algorithms for minimal fixed points (extended abstract), ICALP, volume 1443 of LNCS, 1998.

D. Lugiez, P. Niebert, and S. Zennou, A partial order semantics approach to the clock explosion problem of timed automata, Theoretical Computer Science, vol.345, issue.1, pp.27-59, 2005.
DOI : 10.1016/j.tcs.2005.07.023

O. Maler, A. Pnueli, and J. Sifakis, On the synthesis of discrete controllers for timed systems, STACS, 1995.
DOI : 10.1007/3-540-59042-0_76

P. Morris, A Structural Characterization of Temporal Dynamic Controllability, CP, 2006.
DOI : 10.1007/11889205_28

P. Morris, N. Muscettola, and T. Vidal, Dynamic control of plans with temporal uncertainty, IJCAI, 2001.

S. Tripakis and K. Altisen, On-the-fly controller synthesis for discrete and densetime systems, In FM LNCS, vol.1706, 1999.

T. Vidal, A unified dynamic approach for dealing with temporal uncertainty and conditional planning, ICAPS, 2000.

T. Vidal and H. Fargier, Handling contingency in temporal constraint networks: from consistency to controllabilities, Journal of Experimental & Theoretical Artificial Intelligence, vol.6, issue.1, 1999.
DOI : 10.1016/0933-3657(91)90004-U