B. Bérard, S. Haar, S. Schmitz, and S. Schwoon, The Complexity of Diagnosability and Opacity Verification for Petri Nets, Petri nets 2017, 2017.

N. Bertrand, S. Haddad, and E. Lefaucheux, Foundation of diagnosis and predictability in probabilistic systems, Proceedings of FSTTCS'14, vol.29, pp.417-429, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01088117

N. Bertrand, S. Haddad, and E. Lefaucheux, Diagnosis in infinite-state probabilistic systems, 14. Leibniz-Zentrum für Informatik, vol.59, pp.1-37, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01373354

H. Boucheneb and K. Barkaoui, Reducing interleaving semantics redundancy in reachability analysis of time Petri nets, ACM Trans. Embed. Comput. Syst, vol.12, issue.1, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01126311

M. P. Cabasino, A. Giua, S. Lafortune, and C. Seatzu, A new approach for diagnosability analysis of petri nets using verifier nets, IEEE Transactions on Automatic Control, vol.57, issue.12, pp.3104-3117, 2012.

M. P. Cabasino, A. Giua, and C. Seatzu, Fault detection for discrete event systems using Petri nets with unobservable transitions, Automatica, vol.46, issue.9, pp.1531-1539, 2010.

M. P. Cabasino, A. Giua, and C. Seatzu, Introduction to Petri Nets, pp.191-211, 2013.

M. P. Cabasino, A. Giua, and C. Seatzu, Diagnosability of discrete-event systems using labeled Petri nets, IEEE Trans. Automation Science and Engineering, vol.11, issue.1, pp.144-153, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01479636

M. P. Cabasino, A. Giua, M. Pocci, and C. Seatzu, Discrete event diagnosis using labeled Petri nets. an application to manufacturing systems, Control Engineering Practice, vol.19, issue.9, pp.989-1001, 2011.
DOI : 10.1109/tase.2013.2289360

URL : https://hal.archives-ouvertes.fr/hal-01479645

C. G. Cassandras and S. Lafortune, Introduction to Discrete Event SystemsSecond Edition, 2008.

J. Esparza and M. Nielsen, Decidability issues for Petri nets-a survey, 1994.
DOI : 10.7146/brics.v1i8.21662

URL : https://tidsskrift.dk/brics/article/download/21662/19099

A. Giua, C. Seatzu, and D. Corona, Marking estimation of Petri nets with silent transitions, IEEE Transactions on Automatic Control, vol.52, issue.9, pp.1695-1699, 2007.

P. Godefroid, Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem, vol.1032, 1996.

S. Haar, S. Haddad, T. Melliti, and S. Schwoon, Optimal constructions for active diagnosis, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol.24, pp.527-539, 2013.
DOI : 10.1016/j.jcss.2016.04.007

URL : https://hal.archives-ouvertes.fr/hal-01408047

S. Haddad and P. Moreaux, Stochastic Petri Nets, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00441922

R. M. Karp and R. E. Miller, Parallel program schemata, Journal of Computer and System Sciences, vol.3, issue.2, pp.147-195, 1969.

Z. Y. Ma, Y. Tong, Z. W. Li, and A. Giua, Basis marking representation of Petri net reachability spaces and its application to the reachability problem, IEEE Transactions on Automatic Control, vol.62, issue.3, pp.1078-1093, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01479615

M. A. Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis, Modelling with Generalized Stochastic Petri Nets, 1994.
DOI : 10.1145/288197.581193

E. W. Mayr, An algorithm for the general Petri net reachability problem, Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, STOC '81, pp.238-246, 1981.
DOI : 10.1145/800076.802477

T. Murata, Petri nets: Properties, analysis and applications, Proceedings of the IEEE, vol.77, pp.541-580, 1989.

M. Nielsen, G. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, issue.1, pp.85-108, 1981.
DOI : 10.1016/0304-3975(81)90112-2

URL : https://doi.org/10.1016/0304-3975(81)90112-2

P. Reynier and F. Servais, Minimal coverability set for Petri nets: Karp and miller algorithm with pruning, Fundamenta Informaticae, vol.122, issue.1-2, pp.1-30, 2013.
DOI : 10.1007/978-3-642-21834-7_5

URL : https://hal.archives-ouvertes.fr/hal-00554919

R. Lipton, The Reachability Problem Requires Exponential Space, 1976.

M. Sampath, R. Sengupta, S. Lafortune, K. Sinnamohideen, and D. Teneketzis, Diagnosability of discrete-event systems, IEEE Trans. Aut. Cont, vol.40, issue.9, pp.1555-1575, 1995.
DOI : 10.1109/9.412626

W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol.4, issue.2, pp.177-192, 1970.
DOI : 10.1016/s0022-0000(70)80006-x

URL : https://doi.org/10.1016/s0022-0000(70)80006-x

D. Thorsley and D. Teneketzis, Diagnosability of stochastic discrete-event systems, IEEE Transactions on Automatic Control, vol.50, issue.4, pp.476-492, 2005.
DOI : 10.1109/tac.2005.844722

URL : http://web.eecs.umich.edu/~teneket/pubs/DiagnosabilityStochasticDES-2005.pdf

Y. Tong, Z. Li, C. Seatzu, and A. Giua, Verification of state-based opacity using Petri nets, IEEE Transactions on Automatic Control, vol.62, issue.6, pp.2823-2837, 2017.
DOI : 10.1109/tac.2016.2620429

URL : https://hal.archives-ouvertes.fr/hal-01786028

A. Valmari, The state explosion problem, pp.429-528, 1998.
DOI : 10.1007/3-540-65306-6_21