A study of the recoverability of computing systems, 1974. ,
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
Weak Time Petri Nets Strike Back!, LNCS, vol.13, issue.3, pp.557-571, 2009. ,
DOI : 10.1007/3-540-60922-9_29
URL : https://hal.archives-ouvertes.fr/hal-00374482
Decidable Classes of Unbounded Petri Nets with Time and Urgency, PETRI NETS'16, pp.301-322, 2016. ,
DOI : 10.1007/978-3-642-04081-8_37
URL : https://hal.archives-ouvertes.fr/hal-01379414
Dynamical properties of timed automata, In DEDS, vol.10, issue.12, pp.87-113, 2000. ,
DOI : 10.1007/BFb0055349
Robustness of time Petri nets under guard enlargement, Fundam, Inform, vol.143, pp.3-4 ,
DOI : 10.1007/978-3-642-33512-9_9
URL : http://hal.univ-nantes.fr/docs/00/87/98/32/PDF/RP12_robustTPN.pdf
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
Free Choice Petri nets, 1995. ,
Timed Petri Nets and BQOs, Proc. of ICATPN 2001, pp.53-70, 2001. ,
DOI : 10.1007/3-540-45740-2_5
URL : http://www.it.uu.se/research/docs/fm/apv/tools/tpns/files/bqo.pdf
Timed processes of timed Petri nets, Proc. of ICATPN, pp.490-509, 1995. ,
Algebras of processes of timed Petri nets, in: CONCUR '94, LNCS, vol.836, pp.194-209, 1994. ,
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
URL : https://doi.org/10.1016/s0304-3975(99)00114-0
Time process equivalences for time Petri nets, Workshop on Concurrency, Specification and Programming, pp.257-268, 2014. ,
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets, pp.125-145, 2006. ,
DOI : 10.1007/11767589_8
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
Combining Free Choice and Time in Petri Nets, 2016 23rd International Symposium on Temporal Representation and Reasoning (TIME), pp.120-129, 2016. ,
DOI : 10.1109/TIME.2016.20
URL : https://hal.archives-ouvertes.fr/hal-01379440
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
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
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
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/s100090050010
URL : https://hal.archives-ouvertes.fr/hal-00488957
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
URL : https://doi.org/10.1016/0304-3975(78)90036-1
Recent and simple algorithms for Petri nets, Software and System Modeling, pp.719-725, 2015. ,
DOI : 10.1007/s10270-014-0426-0
Reachability of Communicating Timed Processes, FoSSaCS LNCS, vol.7794, pp.81-96, 2013. ,
DOI : 10.1007/978-3-642-37075-5_6
URL : https://hal.archives-ouvertes.fr/hal-00744085