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

S. Jiang, Z. Huang, V. Chandra, and R. Kumar, A polynomial algorithm for testing diagnosability of discrete-event systems, IEEE Transactions on Automatic Control, vol.46, issue.8, pp.1318-1321, 2001.
DOI : 10.1109/9.940942

T. Yoo and S. Lafortune, Polynomial-time verification of diagnosability of partially observed discrete event systems, IEEE Transactions on Automatic Control, vol.47, issue.9, pp.1491-1495, 2002.

V. Germanos, S. Haar, V. Khomenko, and S. Schwoon, Diagnosability under weak fairness, ACM Transactions on Embedded Computer Systems, vol.144, pp.6910-1145, 2015.
DOI : 10.1145/2832910
URL : https://hal.archives-ouvertes.fr/hal-01091162

S. Haar, Qualitative diagnosability of labeled petri nets revisited, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, 2009.
DOI : 10.1109/CDC.2009.5400917
URL : https://hal.archives-ouvertes.fr/inria-00638286

S. Haar, Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets, IEEE Transactions on Automatic Control, vol.55, issue.10, p.55, 2010.
DOI : 10.1109/TAC.2010.2063490
URL : https://hal.archives-ouvertes.fr/inria-00379540

S. Haar, What topology tells us about diagnosability in partial order semantics. Discrete Event Dynamic Systems, pp.383-402, 2012.
DOI : 10.1007/s10626-011-0121-z
URL : https://hal.archives-ouvertes.fr/inria-00583666

S. Haar, C. Rodríguez, and S. Schwoon, Reveal your faults: it's only fair! In: Proceedings of ACSD'13, IEEE
DOI : 10.1109/acsd.2013.15
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HRS-acsd13.pdf

W. Vogler, Fairness and partial order semantics, Information Processing Letters, vol.55, issue.1, pp.33-3900049, 1995.
DOI : 10.1016/0020-0190(95)00049-I

P. Jan?ar, Decidability of a temporal logic problem for Petri nets. Theoretical Computer Science, pp.71-93, 1990.

J. Bryans, M. Koutny, L. Mazaré, and P. Ryan, Opacity generalised to transition systems, International Journal of Information Security, vol.79, issue.3???4, pp.421-435, 2008.
DOI : 10.1007/3-540-56689-9_45
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKMR-fast05.pdf

F. Cassez, J. Dubreil, and H. Marchand, Dynamic Observers for the Synthesis of Opaque Systems, Proceedings of ATVA'09, pp.352-367, 2009.
DOI : 10.1007/978-3-642-04761-9_26
URL : https://hal.archives-ouvertes.fr/inria-00396442

Y. Tong, Z. Li, C. Seatzu, and A. Giua, Verification of initial-state opacity in Petri nets, 2015 54th IEEE Conference on Decision and Control (CDC)
DOI : 10.1109/CDC.2015.7402224

E. Badouel, M. Bednarczyk, A. Borzyszkowski, B. Caillaud, and P. Darondeau, Concurrent secrets. Discrete Event Dynamic Systems, pp.425-446, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070249

F. Lin, Opacity of discrete event systems and its applications, Automatica, vol.47, issue.3, pp.496-503, 2011.
DOI : 10.1016/j.automatica.2011.01.002

N. Busi and R. Gorrieri, Structural non-interference in elementary and trace nets, Mathematical Structures in Computer Science, vol.1491, issue.06, pp.1065-1090, 2009.
DOI : 10.1007/3-540-65306-6_14

E. Best, P. Darondeau, and R. Gorrieri, On the Decidability of Non Interference over Unbounded Petri Nets, Proceedings of SecCo'10, volume 51 of Electronic Proceedings in Theoretical Computer Science, pp.16-33, 2010.
DOI : 10.4204/EPTCS.51.2
URL : https://hal.archives-ouvertes.fr/inria-00591568

R. Howell, L. Rosier, and Y. Hc, A taxonomy of fairness and temporal logic problems for Petri nets, Theoretical Computer Science, vol.82, issue.2, pp.341-37210, 1991.
DOI : 10.1016/0304-3975(91)90228-T

J. Esparza, Decidability and complexity of Petri net problems ??? An introduction, pp.374-428, 1996.
DOI : 10.1007/3-540-65306-6_20

A. Mayer and L. Stockmeyer, The complexity of word problems?this time with interleaving. Information and Computation, pp.293-311, 1994.

M. 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.
DOI : 10.1109/TAC.2012.2200372

S. Schmitz, Automata column: The complexity of reachability in vector addition systems, ACM SIGLOG News, vol.3, issue.1, pp.3-21, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01275972

R. Lipton, The reachability problem requires exponential space, 1976.

J. Leroux and S. Schmitz, Demystifying Reachability in Vector Addition Systems, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
DOI : 10.1109/LICS.2015.16
URL : https://hal.archives-ouvertes.fr/hal-01168388

B. Bérard, S. Haar, S. Schmitz, and S. Schwoon, The complexity of diagnosability and opacity verification for Petri nets, Proceedings of PN 2017, 2017.

A. Madalinski and V. Khomenko, Diagnosability verification with parallel LTL-X model checking based on Petri net unfoldings, 2010 Conference on Control and Fault-Tolerant Systems (SysTol), pp.398-403, 2010.
DOI : 10.1109/SYSTOL.2010.5676089

S. Even, On Information Lossless Automata of Finite Order, IEEE Transactions on Electronic Computers, vol.14, issue.4, pp.561-569, 1965.
DOI : 10.1109/PGEC.1965.263996

M. Vardi and P. Wolper, An automata-theoretic approach to automatic program verification, Proceedings of LICS 1986, pp.332-344, 1986.

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

Y. Tong, Z. Li, C. Seatzu, and A. Giua, Decidability of opacity verification problems in labeled Petri net systems, Automatica, vol.80, pp.48-53, 2017.
DOI : 10.1016/j.automatica.2017.01.013
URL : https://hal.archives-ouvertes.fr/hal-01785998

P. Jan?ar, Nonprimitive recursive complexity and undecidability for Petri net equivalences, Theoretical Computer Science, vol.256, issue.1-2, pp.23-30, 2001.
DOI : 10.1016/S0304-3975(00)00100-6

E. Pelz, Closure properties of deterministic Petri nets, Proceedings of STACS'87, pp.371-382, 1987.
DOI : 10.1007/BFb0039620

P. Habermehl, On the complexity of the linear-time µ-calculus for Petri nets In: Proceedings of PN'97, volume 1248 of Lecture Notes in Computer Science, 1997.

X. Yin and S. Lafortune, On the Decidability and Complexity of Diagnosability for Labeled Petri Nets, IEEE Transactions on Automatic Control, vol.62, issue.11, pp.625931-5938, 2017.
DOI : 10.1109/TAC.2017.2699278

M. Atig and P. Habermehl, ON YEN'S PATH LOGIC FOR PETRI NETS, International Journal of Foundations of Computer Science, vol.56, issue.04, pp.783-799, 2011.
DOI : 10.1006/inco.1996.0013