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

G. Behrmann, Distributed reachability analysis in timed automata, International Journal on Software Tools for Technology Transfer, vol.11, issue.1, pp.19-30, 2005.
DOI : 10.1007/s10009-003-0111-z

G. Behrmann, P. Bouyer, K. G. Larsen, and R. Pelánek, Lower and upper bounds in zone-based abstractions of timed automata, International Journal on Software Tools for Technology Transfer, vol.1, issue.1???2, pp.204-215, 2006.
DOI : 10.1007/s10009-005-0190-0

G. Behrmann and A. Fehnker, Efficient guiding towards cost-optimality in UPPAAL, pp.174-188, 2001.

G. Behrmann, T. Hune, and F. W. Vaandrager, Distributing Timed Model Checking ??? How the Search Order Matters, pp.216-231, 2000.
DOI : 10.1007/10722167_19

G. Behrmann, K. G. Larsen, and R. Pelánek, To Store or Not to Store, pp.433-445, 2003.
DOI : 10.1007/978-3-540-45069-6_40

V. Braberman, A. Olivero, and F. Schapachnik, Zeus: A distributed timed modelchecker based on Kronos, Electronic notes in theoretical computer science, pp.503-522, 2002.

C. Daws and S. Tripakis, Model checking of real-time reachability properties using abstractions, pp.313-329, 1998.
DOI : 10.1007/BFb0054180

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

S. Evangelista and L. Kristensen, Search-order independent state caching. T. Petri Nets and Other Models of Concurrency 4, pp.21-41, 2010.

P. Godefroid, G. J. Holzmann, and D. Pirottin, State-space caching revisited, Formal Methods in System Design, vol.13, issue.No. 6, pp.227-241, 1995.
DOI : 10.1007/BF01384077

R. Pleánek, V. Roseck´yroseck´y, and J. Sedenka, Evaluation of state caching and state compression techniques, Tech. rep, 2008.