P. M. Merlin, A Study of the Recoverability of Computing Systems, 1974.

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 F. Vernadat, State Class Constructions for Branching Analysis of Time Petri Nets, In: TACAS, pp.442-457, 2003.
DOI : 10.1007/3-540-36577-X_33

T. Yoneda and H. Ryuba, Ctl model checking of time petri nets using geometric regions, IEICE Trans. E81-D, issue.3, pp.297-396, 1998.

R. Sloan and U. Buy, Reduction rules for time Petri nets, Acta Informatica, vol.33, issue.7, pp.687-706, 1996.
DOI : 10.1007/s002360050066

G. Bucci and E. Vicario, Compositional validation of time-critical systems using communicating time Petri nets, IEEE Transactions on Software Engineering, vol.21, issue.12, pp.969-992, 1995.
DOI : 10.1109/32.489073

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm, TACAS, vol.1, 1055.
DOI : 10.1007/3-540-61042-1_40

K. L. Mcmillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, Proc. Fourth Workshop on Computer-Aided Verification, pp.164-177, 1992.
DOI : 10.1007/3-540-56496-9_14

J. Engelfriet, Branching processes of Petri nets, Acta Informatica, vol.4, issue.6, pp.575-591, 1991.
DOI : 10.1007/BF01463946

A. Semenov and A. Yakovlev, Verification of asynchronous circuits using time petri net unfolding, DAC '96: Proceedings of the 33rd annual conference on Design automation, pp.59-62, 1996.

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

M. Sogbohossou and D. Delfieu, Temporal reduction in time Petri net, 2008 3rd International Design and Test Workshop, 2008.
DOI : 10.1109/IDT.2008.4802509
URL : https://hal.archives-ouvertes.fr/hal-01112529

D. Delfieu, M. Sogbohossou, L. M. Traonouez, and S. Revol, Parameterized study of a time petri net, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01112535

P. M. Merlin and D. J. Faber, Recoverability of Communication Protocols--Implications of a Theoretical Study, IEEE Transactions on Communications, vol.24, issue.9, pp.1036-1043, 1976.
DOI : 10.1109/TCOM.1976.1093424

A. Cerone and A. Maggiolo-schettini, Time-based expressivity of time Petri nets for system specification, Theoretical Computer Science, vol.216, issue.1-2, pp.1-53, 1999.
DOI : 10.1016/S0304-3975(98)00008-5

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

R. Dechter, I. Meiri, and J. Pearl, Temporal constraint networks, Artificial Intelligence, vol.49, issue.1-3, pp.61-95, 1991.
DOI : 10.1016/0004-3702(91)90006-6

B. Pradin-chézalviel, R. Valette, and L. A. Künzle, Scenario durations characterization of t-timed Petri nets using linear logic, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331), pp.208-217, 1999.
DOI : 10.1109/PNPM.1999.796567

J. Y. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

B. Berthomieu and M. Menasche, An enumerative approach for analyzing time petri nets, In: IFIP Congress, pp.41-46, 1983.

E. Vicario, Static analysis and dynamic steering of time-dependent systems, IEEE Transactions on Software Engineering, vol.27, issue.8, pp.728-748, 2001.
DOI : 10.1109/32.940727

T. Aura and J. Lilius, Time processes for time Petri nets, In: ICATPN. LNCS, vol.1248, pp.136-155, 1997.
DOI : 10.1007/3-540-63139-9_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.946