P. A. Abdulla and A. Nylén, Timed Petri Nets and BQOs, Proc. of ICATPN 2001, pp.53-70, 2001.
DOI : 10.1007/3-540-45740-2_5

S. Akshay, B. Genest, and L. Hélouët, Decidable Classes of Unbounded Petri Nets with Time and Urgency, PETRI NETS'16, pp.301-322, 2016.
DOI : 10.1007/978-3-319-39086-4_18
URL : https://hal.archives-ouvertes.fr/hal-01379414

S. Akshay, L. Hélouët, C. Jard, and P. Reynier, Robustness of time Petri nets under guard enlargement, Fundam. Inform, vol.143, pp.3-4207, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01379431

S. Akshay, L. Helouet, and R. Phawade, Combining Free Choice and Time in Petri Nets, 2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)
DOI : 10.1109/TIME.2016.20
URL : https://hal.archives-ouvertes.fr/hal-01379440

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

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

H. Boucheneb, D. Lime, and O. H. Roux, On Multi-enabledness in Time Petri Nets, Proc. of PETRI NETS'13, pp.130-149, 2013.
DOI : 10.1007/978-3-642-38697-8_8
URL : https://hal.archives-ouvertes.fr/hal-00940994

M. Boyer and M. Diaz, Multiple enabledness of transitions in Petri nets with time, Proceedings 9th International Workshop on Petri Nets and Performance Models, pp.219-228, 2001.
DOI : 10.1109/PNPM.2001.953371

D. Bushin and I. Virbitskaite, Time process equivalences for time Petri nets, Workshop on Concurrency, Specification and Programming, volume 1269 of CEUR Workshop, pp.257-268, 2014.

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. Chatain and C. Jard, Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets, ICATPN'06, pp.125-145, 2006.
DOI : 10.1007/11767589_8

T. Chatain and C. Jard, Back in Time Petri Nets, Proc. of FORMATS'13, pp.91-105, 2013.
DOI : 10.1007/978-3-642-40229-6_7
URL : https://hal.archives-ouvertes.fr/hal-00840344

J. Esparza and J. Desel, Free Choice Petri nets, 1995.

A. Finkel and J. Leroux, Recent and simple algorithms for Petri nets. Software and System Modeling, pp.719-725, 2015.

N. D. Jones, L. H. Landweber, and Y. E. Lien, Complexity of some problems in Petri nets, Theoretical Computer Science, vol.4, issue.3, pp.277-299, 1977.
DOI : 10.1016/0304-3975(77)90014-7

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

A. Puri, Dynamical properties of timed automata, DEDS, pp.87-113, 2000.
DOI : 10.1007/BFb0055349

C. Rackoff, The covering and boundedness problems for vector addition systems, Theoretical Computer Science, vol.6, issue.2, pp.223-231, 1978.
DOI : 10.1016/0304-3975(78)90036-1

P. A. Reynier and A. Sangnier, Weak time Petri nets strike back! In CONCUR, LNCS, vol.5710, pp.557-571, 2009.

V. Ruiz, D. De-frutos-escrig, and F. Cuartero, Timed processes of timed Petri nets, Proc. of ICATPN'95, pp.490-509, 1995.

J. Winkowski, Algebras of Processes of Timed Petri Nets, CONCUR '94, pp.194-209, 1994.
DOI : 10.1007/978-3-540-48654-1_18