R. Alur and D. 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, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson et al., Minimum-Cost Reachability for Priced Timed Automata, Proc. 4th International Workshop on Hybrid Systems: Computation and Control (HSCC'01), pp.147-161, 2001.
DOI : 10.7146/brics.v8i3.20457

M. Ramzi-ben-salah, O. Bozga, and . Maler, On interleaving in timed automata, Proceedings of the 17 th International Conference on Concurrency Theory (CONCUR'06), 2006.

B. Bérard, F. Cassez, S. Haddad, O. H. Roux, and D. Lime, Comparison of the Expressiveness of Timed Automata and Time Petri Nets, Proceedings of the third International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'05), pp.211-225, 2005.
DOI : 10.1007/11603009_17

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

P. Bouyer, Forward analysis of updatable timed automata. Formal Methods in System Design, pp.281-320, 2004.

F. Cassez, T. Chatain, and C. Jard, Symbolic Unfoldings for Networks of Timed Automata, IRCCyN/CNRS, 2006.
DOI : 10.1007/11901914_24
URL : https://hal.archives-ouvertes.fr/inria-00363033

F. Cassez and O. H. Roux, Structural translation from time petri nets to timed automata, Journal of Systems and Software, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00139236

T. Chatain and C. Jard, Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets, ICATPN, pp.125-145, 2006.
DOI : 10.1007/11767589_8

J. Esparza and S. Römer, An Unfolding Algorithm for Synchronous Products of Transition Systems, In CONCUR LNCS, vol.1664, pp.2-20, 1999.
DOI : 10.1007/3-540-48320-9_2

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm. Formal Methods in System Design, pp.285-310, 2002.

H. Fleischhack and C. Stehno, Computing a Finite Prefix of a Time Petri Net, ICATPN, pp.163-181, 2002.
DOI : 10.1007/3-540-48068-4_11

J. Bengtsson, B. Jonsson, J. Lilius, and W. Yi, Partial order reductions for timed systems, CONCUR 99, pp.485-500, 1999.
DOI : 10.1007/BFb0055643

K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi, Efficient verification of realtime systems: Compact data structure and state-space reduction, Proc. 18th IEEE Real- Time Systems Symposium (RTSS'97), pp.14-24, 1997.

D. Lugiez, P. Niebert, and S. Zennou, A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata, Proc. 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.296-311, 2004.
DOI : 10.1007/978-3-540-24730-2_24

L. Kenneth and . Mcmillan, A technique of state space search based on unfolding, Formal Methods in System Design, vol.6, issue.1, pp.45-65, 1995.

P. M. Merlin and D. J. Farber, Recoverability of communication protocols ? implications of a theorical study, IEEE Transactions on Communications, vol.24, 1976.

M. Minea, Partial Order Reduction for Model Checking of Timed Automata, CONCUR 99, pp.431-446, 1999.
DOI : 10.1007/3-540-48320-9_30

T. Aura and J. Lilius, A causal semantics for time Petri nets, Theoretical Computer Science, vol.243, issue.1-2, pp.409-447, 2000.
DOI : 10.1016/S0304-3975(99)00114-0

T. Yoneda and B. Schlingloff, Efficient verification of parallel real-time systems, Formal Methods in System Design, vol.2, issue.11, pp.187-215, 1997.
DOI : 10.1007/3-540-56922-7_27

A. Valmari, Stubborn sets for reduced state space generation, Applications and Theory of Petri Nets, pp.491-515, 1989.
DOI : 10.1007/3-540-53863-1_36

W. Belluomini and C. J. Myers, Verification of timed systems using POSETs, CAV 98, pp.403-415, 1998.
DOI : 10.1007/BFb0028762