R. Alur and D. Dill, Automata for modeling real-time systems, ICALP 1990, pp.322-335, 1990.
DOI : 10.1007/BFb0032042

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

E. Asarin, M. Bozga, A. Kerbrat, O. Maler, A. Pnueli et al., Datastructures for the verification of timed automata, LNCS, vol.1201, pp.346-360, 1997.

G. Behrmann, P. Bouyer, E. Fleury, and K. Larsen, Static Guard Analysis in Timed Automata Verification, TACAS 2003, pp.254-270, 2003.
DOI : 10.1007/3-540-36577-X_18
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBFL-tacas-2003.pdf

G. Behrmann, P. Bouyer, K. Larsen, and R. Pelnek, Lower and upper bounds in zone based abstractions of timed automata, TACAS 2004, pp.312-326, 2004.

J. Bengtsson and W. Yi, Timed Automata: Semantics, Algorithms and Tools, Lectures on Concurrency and Petri Nets, pp.87-124, 2004.
DOI : 10.1007/978-3-540-27755-2_3
URL : http://www.seas.upenn.edu/~lee/09cis480/papers/by-lncs04.pdf

D. Beyer, Improvements in BDD-Based Reachability Analysis of Timed Automata, FME 2001, pp.318-343, 2001.
DOI : 10.1007/3-540-45251-6_18

E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-guided abstraction refinement, LNCS, vol.1855, pp.154-169, 2000.
DOI : 10.1109/time.2003.1214874
URL : http://www.aladdin.cs.cmu.edu/papers/pdfs/y2000/counterex.pdf

H. Dierks, S. Kupferschmid, and K. Larsen, Automatic Abstraction Refinement for Timed Automata, FORMATS 2007, pp.114-129, 2007.
DOI : 10.1007/978-3-540-75454-1_10
URL : http://www.informatik.uni-freiburg.de/~ki/papers/dierks-etal-formats2007.pdf

T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, Lazy abstraction, pp.58-70, 2002.
DOI : 10.1145/503272.503279

F. Herbreteau, D. Kini, B. Srivathsan, and I. Walukiewicz, Using non-convex approximations for efficient analysis of timed automata, pp.78-89, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00559902

F. Herbreteau, B. Srivathsan, and I. Walukiewicz, Lazy Abstractions for Timed Automata, CAV 2013, pp.990-1005, 2013.
DOI : 10.1007/978-3-642-39799-8_71
URL : https://hal.archives-ouvertes.fr/hal-00775924

F. Herbreteau, B. Srivathsan, and I. Walukiewicz, Lazy Abstractions for Timed Automata, p.3127, 2013.
DOI : 10.1007/978-3-642-39799-8_71
URL : https://hal.archives-ouvertes.fr/hal-00775924

K. Mcmillan, Lazy Abstraction with Interpolants, CAV 2006, pp.123-136, 2006.
DOI : 10.1007/11817963_14

M. Sorea, Lazy Approximation for Dense Real-Time Systems, LNCS, vol.3253, pp.363-378, 2004.
DOI : 10.1007/978-3-540-30206-3_25
URL : http://www.csl.sri.com/users/sorea/papers/FORMATS04/lazy.ps

B. Wozna, A. Zbrzezny, and W. Penczek, Checking reachability properties for timed automata via sat, Fundam. Inf, vol.55, issue.2, pp.223-241, 2003.

S. Yovine, Model checking timed automata, Lectures on Embedded Systems, pp.114-152, 1998.
DOI : 10.1007/3-540-65193-4_20