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

N. Jones, L. Landweber, and Y. Lien, Complexity of some problems in Petri nets, TCS, vol.4, issue.3, pp.277-299, 1977.

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

S. Akshay, B. Genest, and L. Hélouët, Decidable classes of unbounded Petri nets with time and urgency, PETRI NETS'16, vol.9698, pp.301-322, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01379414

A. Puri, Dynamical properties of timed automata, In DEDS, vol.10, issue.1-2, pp.87-113, 2000.

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

H. Boucheneb, D. Lime, and O. Roux, On multi-enabledness in time Petri nets, Proc. of PETRI NETS'13, vol.7927, pp.130-149, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00940994

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

P. Abdulla and A. Nylén, Timed Petri nets and BQOs, Proc. of ICATPN 2001, vol.2075, pp.53-70, 2001.

J. Byg, K. Y. Jørgensen, and J. Srba, TAPAAL: editor, simulator and verifier of timed-arc petri nets, in: Automated Technology for Verification and Analysis, 7th International Symposium, vol.5799, pp.84-89, 2009.

L. Jacobsen, M. Jacobsen, M. H. Møller, and J. Srba, Verification of timed-arc Petri nets, SOFSEM'11, vol.6543, pp.46-72, 2011.

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

J. Winkowski, Algebras of processes of timed Petri nets, CONCUR '94, vol.836, pp.194-209, 1994.

T. Aura and J. Lilius, A causal semantics for time Petri nets, TCS, vol.243, issue.1-2, pp.409-447, 2000.

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

T. Chatain and C. Jard, Complete finite prefixes of symbolic unfoldings of safe time Petri nets, ICATPN'06, pp.125-145, 2006.

T. Chatain and C. Jard, Back in time Petri nets, Proc. of FORMATS'13, vol.8053, pp.91-105, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00925467

S. Akshay, L. Hélouët, and R. Phawade, Combining free choice and time in petri nets, 23rd International Symposium on Temporal Representation and Reasoning, pp.120-129, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01650751

B. Berthomieu and M. Diaz, Modeling and verification of time dependent systems using time Petri nets, IEEE Trans. in Software Engineering, vol.17, issue.3, pp.259-273, 1991.

A. Cerone and A. Maggiolo-schettini, Time-based expressivity of time Petri nets for system specification, TCS, vol.216, issue.1-2, pp.1-53, 1999.

M. Boyer and M. Diaz, Multiple enabledness of transitions in Petri nets with time, Proc. of PNPM'01, pp.219-228, 2001.

U. Goltz and W. Reisig, The non-sequential behavior of petri nets, Information and Control, vol.57, issue.2/3, pp.125-147, 1983.

E. Best and C. Fernández, Nonsequential Processes-A Petri Net View, vol.13, 1988.

J. Engelfriet, Branching processes of petri nets, Acta Inf, vol.28, issue.6, pp.575-591, 1991.

J. Couvreur, D. Poitrenaud, and P. Weil, Branching processes of general Petri nets, Fundam. Inform, vol.122, issue.1-2, pp.31-58, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00625302

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

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm, Proc. of TACAS '96, vol.1055, pp.87-106, 1996.

D. Lime and O. Roux, Model checking of time Petri nets using the state class timed automaton, Journal of Discrete Event Dynamic Systems, vol.16, issue.2, pp.179-205, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00488957

C. Rackoff, The covering and boundedness problem for vector addition systems, TCS, vol.6, pp.223-231, 1978.

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

J. Desel and W. Reisig, Place or transition petri nets, in: Lectures on Petri Nets I: Basic Models, Advances in Petri Nets. Volumes based on the Advanced Course on Petri Nets, Dagstuhl, vol.1491, pp.122-173, 1996.

L. Clemente, F. Herbreteau, A. Stainer, and G. Sutre, Reachability of communicating timed processes., in: FoSSaCS, vol.7794, pp.81-96, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00744085

A. Finkel, P. Mckenzie, and C. Picaronny, A well-structured framework for analysing petri net extensions, Inf. Comput, vol.195, issue.1-2, pp.1-29, 2004.

R. Alur and D. Dill, A theory of timed automata, In TCS, vol.126, issue.2, pp.183-235, 1994.

P. Bouyer, N. Markey, and O. Sankur, Robust model-checking of timed automata via pumping in channel machines, FORMATS 2011, vol.6919, pp.97-112, 2011.