P. Aziz-abdulla, J. Deneux, and J. Worrell, Decidability and Complexity Results for Timed Automata via Channel Machines, pp.1089-1101, 2005.
DOI : 10.1007/11523468_88

R. Alur, &. David, and 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
URL : https://doi.org/10.1016/0304-3975(94)90010-8

P. Chambart and &. Schnoebelen, The Ordinal Recursive Complexity of Lossy Channel Systems, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.205-216, 2008.
DOI : 10.1109/LICS.2008.47

S. Demri and &. Lazi´clazi´c, LTL with the freeze quantifier and register automata, ACM Trans. Comput. Log, vol.10, issue.3, 2009.
DOI : 10.1109/lics.2006.31
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DL-lics2006.pdf

D. Figueira and S. Figueira, Ackermann and Primitive-Recursive Bounds with Dickson's Lemma. ArXiv e-prints Available at http://arxiv, 2010.
DOI : 10.1109/lics.2011.39
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FFSS-arxiv10.pdf

D. Figueira and &. Segoufin, Future-Looking Logics on Data Words and Trees, pp.331-343978, 2009.
DOI : 10.1016/S0020-0190(01)00337-4
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-mfcs09.pdf

M. Jenkins, J. Ouaknine, A. , and J. Worrell, Alternating Timed Automata over Bounded Time, 2010 25th Annual IEEE Symposium on Logic in Computer Science, 2010.
DOI : 10.1109/LICS.2010.45

M. Kaminski and &. Francez, Finite-memory automata, Theoretical Computer Science, vol.134, issue.2, pp.329-363, 1994.
DOI : 10.1016/0304-3975(94)90242-9
URL : https://doi.org/10.1016/0304-3975(94)90242-9

S. Lasota and &. Walukiewicz, Alternating timed automata, ACM Trans. Comput. Log, vol.9, issue.2, 2008.
DOI : 10.1007/978-3-540-31982-5_16
URL : https://hal.archives-ouvertes.fr/hal-00335734

R. Lazi´clazi´c, Safely Freezing LTL, pp.381-392, 2006.

R. Lazi´clazi´c, Safety alternating automata on data words CoRR abs/0802.4237, 2008.

M. H. Löb and &. S. Wainer, Hierarchies of number theoretic functions, I. Archiv für Mathematische Logik und Grundlagenforschung 13, pp.39-51, 1970.

F. Neven, T. Schwentick, &. Victor, and . Vianu, Finite state machines for strings over infinite alphabets, ACM Transactions on Computational Logic, vol.5, issue.3, pp.403-435, 2004.
DOI : 10.1145/1013560.1013562
URL : http://alpha.luc.ac.be/~fneven/papers/infinitetocl.ps

J. Ouaknine and &. Worrell, On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap, pp.54-63, 2004.
DOI : 10.1109/lics.2004.1319600
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=3205&context=compsci

J. Ouaknine and &. Worrell, On the Decidability of Metric Temporal Logic, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.188-197, 2005.
DOI : 10.1109/LICS.2005.33

J. Ouaknine and &. Worrell, Safety Metric Temporal Logic Is Fully Decidable, pp.411-425, 2006.
DOI : 10.1007/3-540-58468-4_191
URL : https://link.springer.com/content/pdf/10.1007%2F11691372_27.pdf

P. Parys and &. Walukiewicz, Weak Alternating Timed Automata, pp.273-284, 2009.
DOI : 10.2168/lmcs-8(3:18)2012
URL : https://hal.archives-ouvertes.fr/hal-00360122

P. Schnoebelen, Revisiting Ackermann-hardness for lossy counter systems and reset Petri nets, MFCS 2010, 2010.
DOI : 10.1007/978-3-642-15155-2_54
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/phs-mfcs10.pdf