N. Abid, S. Dal-zilio, and D. L. Botlan, A formal framework to specify and verify real-time properties on critical systems, International Journal of Critical Computer-Based Systems, vol.5, issue.1/2, pp.4-30, 2014.
DOI : 10.1504/IJCCBS.2014.059593
URL : https://hal.archives-ouvertes.fr/hal-00941248

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, T. Feder, and T. A. Henzinger, The benefits of relaxing punctuality, Journal of the ACM, vol.43, issue.1, pp.116-146, 1996.
DOI : 10.1145/227595.227602

R. Alur and T. A. Henzinger, Real-Time Logics: Complexity and Expressiveness, Information and Computation, vol.104, issue.1, pp.35-77, 1993.
DOI : 10.1006/inco.1993.1025
URL : http://doi.org/10.1006/inco.1993.1025

J. Barnat, L. Brim, V. Havel, J. Havlícek, J. Kriho et al., DiVinE 3.0 ??? An Explicit-State Model Checker for Multithreaded C & C++ Programs, CAV'13, pp.863-868, 2013.
DOI : 10.1007/978-3-642-39799-8_60

E. Bartocci, L. Bortolussi, and L. Nenzi, A Temporal Logic Approach to Modular Design of Synthetic Biological Circuits, CMSB'13, pp.164-177, 2013.
DOI : 10.1007/978-3-642-40708-6_13

M. M. Bersani, M. Rossi, and P. San-pietro, A tool for deciding the satisfiability of continuous-time metric temporal logic, Acta Informatica, vol.411, issue.3, pp.171-206, 2016.
DOI : 10.1007/s00236-015-0229-y

R. Bloem, A. Cimatti, I. Pill, and M. Roveri, SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA, International Journal of Foundations of Computer Science, vol.18, issue.04, pp.727-743, 2007.
DOI : 10.1016/j.tcs.2005.01.016

P. Bouyer, M. Colange, and N. Markey, Symbolic Optimal Reachability in Weighted Timed Automata, CAV'16, pp.513-530, 2016.
DOI : 10.1007/978-3-319-41528-4_28
URL : http://arxiv.org/abs/1602.00481

T. Brihaye, M. Estiévenart, and G. Geeraerts, On MITL and Alternating Timed Automata, FORMATS'13, pp.47-61, 2013.
DOI : 10.1007/978-3-642-40229-6_4

T. Brihaye, M. Estiévenart, and G. Geeraerts, On MITL and Alternating Timed Automata over Infinite Words, FORMATS'14, 2014.
DOI : 10.1007/978-3-319-10512-3_6
URL : http://arxiv.org/abs/1406.4395

P. E. Bulychev, A. David, K. G. Larsen, and G. Li, Efficient controller synthesis for a fragment of MTL0,?, Acta Informatica, vol.51, pp.3-4, 2014.

A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore et al., NuSMV2: An opensource tool for symbolic model checking, CAV'02, pp.359-364, 2002.
DOI : 10.1007/3-540-45657-0_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.8023

K. Claessen, N. Een, and B. Sterin, A circuit approach to LTL model checking, 2013 Formal Methods in Computer-Aided Design, 2013.
DOI : 10.1109/FMCAD.2013.6679391

D. Moura, L. Bjørner, and N. , Satisfiability modulo theories, Communications of the ACM, vol.54, issue.9, pp.69-77, 2011.
DOI : 10.1145/1995376.1995394
URL : https://hal.archives-ouvertes.fr/hal-01095009

A. Dokhanchi, B. Hoxha, and G. Fainekos, Formal requirement debugging for testing and verification of cyber-physical systems, Research Report, 1607.

D. Souza, D. Matteplackel, and R. , A clock-optimal hierarchical monitoring automaton construction for mitl, Research Report, 2013.

J. Fu and U. Topcu, Computational methods for stochastic control with metric interval temporal logic specifications, 2015 54th IEEE Conference on Decision and Control (CDC), pp.7440-7447, 2015.
DOI : 10.1109/CDC.2015.7403395
URL : http://arxiv.org/abs/1503.07193

P. Gastin and D. Oddoux, Fast LTL to Büchi automata translation, CAV'01, pp.53-65, 2001.
DOI : 10.1007/3-540-44585-4_6

R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper, Simple On-the-fly Automatic Verification of Linear Temporal Logic, PSTV'95, pp.3-18, 1995.
DOI : 10.1007/978-0-387-34892-6_1

M. Hammer, A. Knapp, and S. Merz, Truly On-the-Fly LTL Model Checking, TACAS'05, pp.191-205, 2005.
DOI : 10.1007/978-3-540-31980-1_13
URL : https://hal.archives-ouvertes.fr/inria-00000753

Y. Hirshfeld and A. M. Rabinovich, Logics for real time: Decidability and complexity, Fundamenta Informaticae, vol.62, issue.1, pp.1-28, 2004.

Y. Hirshfeld and A. M. Rabinovich, An Expressive Temporal Logic for Real Time, MFCS'06, pp.492-504, 2006.
DOI : 10.1007/11821069_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.3110

G. Kant, A. Laarman, J. Meijer, J. Van-de-pol, S. Blom et al., LTSmin: High-Performance Language-Independent Model Checking, TACAS'15, pp.692-707, 2015.
DOI : 10.1007/978-3-662-46681-0_61
URL : http://eprints.eemcs.utwente.nl/26128/03/LTSmin-author.pdf

S. Karaman, Optimal Planning with Temporal Logic Specifications, Massachussetts Institute of Technology, 2009.

O. Kupferman and M. Y. Vardi, Weak alternating automata are not that weak, ISTCS'97, pp.147-158, 1997.
DOI : 10.1145/377978.377993
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.961

K. G. Larsen, P. Pettersson, and W. Yi, Uppaal in a nutshell, International Journal on Software Tools for Technology Transfer, vol.1, issue.1-2, pp.134-152, 1997.
DOI : 10.1007/s100090050010

O. Maler, D. Nickovic, and A. Pnueli, From MITL to Timed Automata, FOR- MATS'06, pp.274-289, 2006.
DOI : 10.1007/11867340_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.3585

D. E. Muller, A. Saoudi, and P. E. Schupp, Alternating automata, the weak monadic theory of the tree, and its complexity, ICALP'86, pp.275-283, 1986.
DOI : 10.1007/3-540-16761-7_77

J. Ouaknine and J. Worrell, On the decidability and complexity of Metric Temporal Logic over finite words, Logical Methods in Computer Science, vol.3, issue.1, 2007.
DOI : 10.2168/LMCS-3(1:8)2007

E. Plaku and S. Karaman, Motion planning with temporal-logic specifications: Progress and challenges, AI Communications, vol.29, issue.1, pp.151-162, 2016.
DOI : 10.3233/AIC-150682
URL : http://doi.org/10.3233/aic-150682

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

J. F. Raskin and P. Y. Schobbens, The logic of event clocks: Decidability, complexity and expressiveness, Journal of Automata, Languages and Combinatorics, vol.4, issue.3, pp.247-282, 1999.

K. Y. Rozier and M. Y. Vardi, A Multi-encoding Approach for LTL Symbolic Satisfiability Checking, FM'11, pp.417-431, 2011.
DOI : 10.1006/inco.1994.1092

Y. Thierry-mieg, Symbolic Model-Checking Using ITS-Tools, TACAS'15, pp.231-237, 2015.
DOI : 10.1007/978-3-662-46681-0_20
URL : https://hal.archives-ouvertes.fr/hal-01213324

M. Y. Vardi, An automata-theoretic approach to linear temporal logic, Logics for Concurrency, pp.238-266, 1996.
DOI : 10.1007/3-540-60915-6_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.8126

T. Wilke, Specifying timed state sequences in powerful decidable logics and timed automata, FTRTFT'94, pp.694-715, 1994.
DOI : 10.1007/3-540-58468-4_191

M. D. Wulf, L. Doyen, N. Maquet, and J. F. Raskin, Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking, TACAS'08, pp.63-77, 2008.
DOI : 10.1007/978-3-540-78800-3_6

Y. Zhou, D. Maity, and J. S. Baras, Timed automata approach for motion planning using metric interval temporal logic, 2016 European Control Conference (ECC), 2016.
DOI : 10.1109/ECC.2016.7810369
URL : http://arxiv.org/abs/1603.08246