P. A. Abdulla, S. P. Iyer, and A. Nylen, Unfoldings of Unbounded Petri Nets, Proceedings of CAV, pp.495-507, 2000.
DOI : 10.1007/10722167_37

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

P. Baldan, N. Busi, A. Corradini, and G. M. Pinna, Functorial concurrent semantics for Petri nets with read and inhibitor arcs, In: CONCUR, LNCS, vol.1877, pp.442-457, 2000.

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, D. Lime, O. H. Roux, and F. Vernadat, Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches, Discrete Event Dynamic Systems, vol.74, issue.2, pp.133-158, 2007.
DOI : 10.1007/s10626-006-0011-y
URL : https://hal.archives-ouvertes.fr/hal-00489016

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

P. Bouyer, S. Haddad, and P. A. Reynier, Timed Unfoldings for Networks of Timed Automata, Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), pp.292-306, 2006.
DOI : 10.1007/11901914_23

F. Cassez, T. Chatain, and C. Jard, Symbolic Unfoldings for Networks of Timed Automata, Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), pp.307-321, 2006.
DOI : 10.1007/11901914_24
URL : https://hal.archives-ouvertes.fr/inria-00363033

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

T. Chatain and V. Khomenko, On the well-foundedness of adequate orders used for construction of complete unfolding prefixes, Information Processing Letters, vol.104, issue.4, pp.129-136, 2007.
DOI : 10.1016/j.ipl.2007.06.002

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

J. Esparza, Model checking using net unfoldings, Science of Computer Programming, vol.23, issue.2-3, pp.151-195, 1994.
DOI : 10.1016/0167-6423(94)00019-0
URL : http://doi.org/10.1016/0167-6423(94)00019-0

J. Esparza and K. Heljanko, Unfoldings, A Partial-Order Approach to Model Checking. Monographs in Theoretical Computer Science, 2008.

J. Esparza, S. Rmer, and W. Vogler, An improvement of McMillan's unfolding algorithm, Formal Methods in System Design, vol.20, issue.3, pp.285-310, 2002.
DOI : 10.1007/3-540-61042-1_40

E. Fabre, A. Benveniste, S. Haar, and C. Jard, Distributed Monitoring of Concurrent and Asynchronous Systems*, Discrete Event Dynamic Systems, vol.15, issue.1, pp.33-84, 2005.
DOI : 10.1007/s10626-005-5238-5
URL : https://hal.archives-ouvertes.fr/inria-00638342

G. Gardey, O. H. 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, vol.6, issue.3, pp.301-320, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00489232

B. Grabiec, L. M. Traonouez, C. Jard, D. Lime, and O. H. Roux, Diagnosis Using Unfoldings of Parametric Time Petri Nets, 8th International Conference on Formal Modelling and Analysis of Timed Systems (FOR- MATS 2010), pp.137-151, 2010.
DOI : 10.1007/978-3-642-15297-9_12
URL : https://hal.archives-ouvertes.fr/hal-00523597

T. Henzinger, P. Kopke, A. Puri, and P. Varaiya, What's Decidable about Hybrid Automata?, Journal of Computer and System Sciences, vol.57, issue.1, pp.94-124, 1998.
DOI : 10.1006/jcss.1998.1581
URL : http://doi.org/10.1006/jcss.1998.1581

V. Khomenko and M. Koutny, Branching Processes of High-Level Petri Nets, Proceedings of TACAS, pp.458-472, 2003.
DOI : 10.1007/3-540-36577-X_34

D. Lime and O. H. Roux, A Translation Based Method for the Timed Analysis of Scheduling Extended Time Petri Nets, 25th IEEE International Real-Time Systems Symposium, pp.187-196, 2004.
DOI : 10.1109/REAL.2004.9
URL : https://hal.archives-ouvertes.fr/hal-00523591

D. Lime and O. H. Roux, Model Checking of Time Petri Nets Using the State Class Timed Automaton, Discrete Event Dynamic Systems, vol.1, issue.1???2, pp.179-205, 2006.
DOI : 10.1007/s10626-006-8133-9
URL : https://hal.archives-ouvertes.fr/hal-00488957

D. Lime and O. H. Roux, Formal verification of real-time systems with??preemptive scheduling, Real-Time Systems, vol.36, issue.7, pp.118-151, 2009.
DOI : 10.1007/s11241-008-9059-0
URL : https://hal.archives-ouvertes.fr/hal-00453476

D. Lime, O. H. Roux, C. Seidner, and L. M. Traonouez, Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches, 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.54-57, 2009.
DOI : 10.1007/11513988_41

T. Margaria and B. Steffen, An Improvement of McMillan's Unfolding Algorithm, Lecture Notes in Computer Science, vol.1055, 1996.

K. L. Mcmillan, Using unfolding to avoid the state space explosion problem in the verification of asynchronous circuits, Proceedings of Computer Aided Verification (CAV'92), pp.164-177, 1992.

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

L. M. Traonouez, B. Grabiec, C. Jard, D. Lime, and O. H. Roux, Symbolic Unfolding of Parametric Stopwatch Petri Nets, 8th International Symposium on Automated Technology for Verification and Analysis, pp.291-305, 2010.
DOI : 10.1007/978-3-642-15643-4_22
URL : https://hal.archives-ouvertes.fr/hal-00840368

L. M. Traonouez, D. Lime, and O. H. Roux, Parametric model-checking of stopwatch Petri nets, Journal of Universal Computer Science (J.UCS), vol.15, issue.17, pp.3273-3304, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00489033

W. Vogler, A. L. Semenov, and A. Yakovlev, Unfolding and finite prefix for nets with read arcs, 9th International Conference on Concurrency Theory (CONCUR'98), pp.501-516, 1998.
DOI : 10.1007/BFb0055644