R. Alur, C. Courcoubetis, and D. Dill, Model-checking in dense real-time. Information and Computation, pp.2-34, 1993.

R. Alur, C. Courcoubetis, and D. L. Dill, Model-checking for real-time systems, 5th IEEE Symposium on Logic in Computer Science, pp.414-425, 1990.

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, P. Bouyer, E. Fleury, and K. G. Larsen, Static Guard Analysis in Timed Automata Verification, Proceedings of the 9th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'03), volume 2619 of Lecture Notes in Computer Science, pp.254-277, 2003.
DOI : 10.1007/3-540-36577-X_18

G. Behrmann, P. Bouyer, K. G. Larsen, and R. Pelánek, Lower and Upper Bounds in Zone Based Abstractions of Timed Automata, Proceedings of the 10th International Conference on Tools and Algorithms for Construction and Analysis of Systems, pp.312-326, 2004.
DOI : 10.1007/978-3-540-24730-2_25

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

J. Bengtsson and W. Yi, Timed Automata: Semantics, Algorithms and Tools, Lecture Notes on Concurrency and Petri Nets, 2004.
DOI : 10.1007/978-3-540-27755-2_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.8701

B. Bérard, F. Cassez, S. Haddad, D. Lime, and O. Roux, Comparison of the Expressiveness of Timed Automata and Time Petri Nets, 3rd International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS 05), 2005.
DOI : 10.1007/11603009_17

B. Berthomieu, La méthode des classes d'´ etats pour l'analyse des réseaux temporels, 3e congrès Modélisation des Systèmes Réactifs (MSR'2001), pp.275-290, 2001.

B. Berthomieu and M. Diaz, Modeling and verification of time dependent systems using time Petri nets, IEEE Transactions on Software Engineering, vol.17, issue.3, pp.259-273, 1991.
DOI : 10.1109/32.75415

B. Berthomieu and M. Menasche, An enumerative approach for analyzing time Petri nets, Information Processing: proceedings of the IFIP congress 1983, pp.41-46, 1983.

B. Berthomieu and F. Vernadat, State Class Constructions for Branching Analysis of Time Petri Nets, TACAS 2003, pp.442-457, 2003.
DOI : 10.1007/3-540-36577-X_33

H. Boucheneb and G. Berthelot, Towards a simplified building of time Petri Nets reachability graph, Proceedings of 5th International Workshop on Petri Nets and Performance Models, pp.46-55, 1993.
DOI : 10.1109/PNPM.1993.393436

H. Boucheneb and R. Hadjidj, Towards optimal CTL* model checking of time Petri nets, WODES'04, 2004.

P. Bouyer, Timed Automata May Cause Some Troubles, BRICS Report Series, vol.9, issue.35, 2002.
DOI : 10.7146/brics.v9i35.21750
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2933

P. Bouyer, Unteamable timed automata!, Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2003), volume 2607 of lncs, pp.620-631, 2003.

F. Cassez and O. Roux, Structural translation from time Petri nets to timed automata, AVoCS'04, 2004.
DOI : 10.1016/j.entcs.2005.04.009
URL : https://hal.archives-ouvertes.fr/hal-00139236

F. Cassez and O. Roux, Structural translation from Time Petri Nets to Timed Automata ? Model-Checking Time Petri Nets via Timed Automata. The journal of Systems and Software, pp.791456-1468, 2006.

A. Cheng, J. Esparza, and J. Palsberg, Complexity results for 1-safe nets, Theoretical Computer Science, vol.147, issue.1-2, pp.117-136, 1995.
DOI : 10.1016/0304-3975(94)00231-7

C. Daws and S. Tripakis, Model checking of real-time reachability properties using abstractions, Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), 1998.
DOI : 10.1007/BFb0054180

D. Dill, Timing assumptions and verification of finite-state concurrent systems, Proc. of Workshop on Computer Aided Verification Methods for Finite State Systems, pp.197-212, 1989.
DOI : 10.1007/3-540-52148-8_17

G. Gardey, D. Lime, M. Magnin, and O. Roux, Romeo: A Tool for Analyzing Time Petri Nets, Proc. 17th International Conference on Computer Aided Verfication (CAV'05), pp.418-423, 2005.
DOI : 10.1007/11513988_41
URL : https://hal.archives-ouvertes.fr/hal-00523596

G. Gardey and O. , Roux, and O. (F.) Roux. Using zone graph method for computing the state space of a time Petri net, FORMATS'03, volume 2791 of lncs, 2003.

G. Gardey and O. , Roux, and O. (F.) Roux. State space computation and analysis of time Petri nets. Theory and Practice of Logic Programming (TPLP). Special Issue on Specification Analysis and Verification of Reactive Systems, pp.301-320, 2006.

A. Giua, F. Dicesare, and M. Silva, Generalized mutual exclusion constraints on nets with uncontrollable transitions, IEEE Int. Conf. on SMC, 1992.

R. Hadjidj and H. Boucheneb, On-the-fly TCTL model checking for Time Petri Nets using state class graphs, Sixth International Conference on Application of Concurrency to System Design (ACSD'06), 2006.
DOI : 10.1109/ACSD.2006.18

T. A. Henzinger, P. Ho, and H. Wong-toi, A user guide to HyTech, Proc. 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'95), volume 1019 of Lecture Notes in Computer Science, pp.41-71, 1995.
DOI : 10.1007/3-540-60630-0_3

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

D. Lime and O. Roux, State class timed automaton of a time Petri net, 10th International Workshop on Petri Nets and Performance Models, 2003. Proceedings., 2003.
DOI : 10.1109/PNPM.2003.1231549
URL : https://hal.archives-ouvertes.fr/hal-00523588

D. Lime and O. , Roux. Model checking of time Petri nets using the state class timed automaton, Journal of Discrete Events Dynamic Systems -Theory and Applications (DEDS), pp.179-205, 2006.

P. M. Merlin, A study of the recoverability of computing systems, 1974.

Y. Okawa and T. Yoneda, Symbolic CTL model checking of Time Petri nets, Electronics and Communications in Japan, pp.11-20, 1997.

W. Penczek and A. Pólrola, Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata, Proceedings of Applications and Theory of Petri Nets 2004: 25th International Conference, pp.37-76, 2004.
DOI : 10.1007/978-3-540-27793-4_4

L. Popova, On time petri nets, Journal Information Processing and Cybernetics, EIK, vol.27, issue.4, pp.227-244, 1991.

C. Ramchandani, Analysis of asynchronous concurrent systems by timed Petri nets, 1974.

S. Tripakis and S. Yovine, Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design, pp.25-68, 2001.

I. Virbitskaite and E. Pokozy, A partial order method for the verification of time Petri nets, Fundamentals of Computation Theory: 12th International Symposium, FCT'99, pp.547-558, 1999.
DOI : 10.1007/3-540-48321-7_46

T. Yoneda and H. Ryuba, CTL model checking of time Petri nets using geometric regions, IEICE Transactions on Information and Systems, issue.3, pp.297-396, 1998.

S. Yovine, KRONOS: a??verification tool for real-time systems, International Journal on Software Tools for Technology Transfer, vol.1, issue.1-2, pp.123-133, 1997.
DOI : 10.1007/s100090050009