P. A. Abdulla, P. Mahata, and R. Mayr, Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness, Logical Methods in Computer Science, vol.3, issue.1, 2007.
DOI : 10.2168/LMCS-3(1:1)2007

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

S. Akshay, L. Hélouët, C. Jard, and P. Reynier, Robustness of time Petri nets under guard enlargement, RP, pp.92-106, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01379431

F. Bause and P. S. Kritzinger, Stochastic Petri nets -an introduction to the theory, 2002.

B. Bérard, F. Cassez, S. Haddad, D. Lime, and O. H. Roux, Comparison of Different Semantics for Time Petri Nets, ATVA'05, pp.293-307, 2005.
DOI : 10.1007/11562948_23

B. Bérard, F. Cassez, S. Haddad, D. Lime, and O. H. Roux, The expressive power of time Petri nets, Theoretical Computer Science, vol.474, pp.1-20, 2013.
DOI : 10.1016/j.tcs.2012.12.005

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, F. Peres, and F. Vernadat, Bridging the Gap Between Timed Automata and Bounded Time Petri Nets, FORMATS'06, pp.82-97, 2006.
DOI : 10.1007/11867340_7

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

P. Bouyer, N. Markey, and O. Sankur, Robustness in Timed Automata, Proc. of RP, pp.1-18, 2013.
DOI : 10.1007/978-3-642-41036-9_1

. Th, C. Chatain, and . Jard, Back in Time Petri Nets, FORMATS, pp.91-105, 2013.

L. Clemente, F. Herbreteau, A. Stainer, and G. Sutre, Reachability of Communicating Timed Processes, FoSSaCS, pp.81-96, 2013.
DOI : 10.1007/978-3-642-37075-5_6
URL : https://hal.archives-ouvertes.fr/hal-00744085

L. Clemente, F. Herbreteau, and G. Sutre, Decidable Topologies for Communicating Automata with FIFO and Bag Channels, In CONCUR LNCS, vol.8704, pp.281-296, 2014.
DOI : 10.1007/978-3-662-44584-6_20
URL : https://hal.archives-ouvertes.fr/hal-01023456

D. D. 'aprile, S. Donatelli, A. Sangnier, and J. Sproston, From time Petri nets to timed automata: An untimed approach, TACAS, pp.216-230, 2007.

A. David, L. Jacobsen, M. Jacobsen, and J. Srba, A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets, SSV'12, pp.125-140, 2012.
DOI : 10.4204/EPTCS.102.12

M. De-wulf, L. Doyen, N. Markey, and J. Raskin, Robust safety of timed automata. Formal Methods in System Design, pp.45-84, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01194592

A. Finkel, . Ph, and . Schnoebelen, Well-structured transition systems everywhere! In TCS, pp.63-92, 2001.

S. Haddad, Time and timed Petri nets, Disc PhD School 2011, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00115535

L. Jacobsen, M. Jacobsen, M. H. Møller, and J. Srba, Verification of Timed-Arc Petri Nets, SOFSEM'11, pp.46-72, 2011.
DOI : 10.1007/978-3-540-85778-5_3

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

J. A. Mateo, J. Srba, and M. G. Sørensen, Soundness of Timed-Arc Workflow Nets, PETRI NETS'14, pp.51-70, 2014.
DOI : 10.1007/s00165-010-0161-4

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

P. Reynier and A. Sangnier, Weak Time Petri Nets Strike Back!, Proc. of CONCUR 2009, pp.557-571, 2009.
DOI : 10.1007/3-540-60922-9_29
URL : https://hal.archives-ouvertes.fr/hal-00374482

V. V. Ruiz, F. C. Gomez, and D. De-frutos-escrig, On non-decidability of reachability for timed-arc Petri nets, PNPM, p.188, 1999.

B. Walter, Timed Petri-Nets for Modelling and Analysing Protocols with Real-Time Characteristics, Proc. of PSTV, pp.149-159, 1983.