The Complexity of Diagnosability and Opacity Verification for Petri Nets

Béatrice Bérard; Stefan Haar; Sylvain Schmitz; Stefan Schwoon

doi:10.3233/FI-2018-1706

The Complexity of Diagnosability and Opacity Verification for Petri Nets

Béatrice Bérard ^{1, 2} Stefan Haar ^{3, 2} Sylvain Schmitz ² Stefan Schwoon ^{3, 2}

1 MoVe - Modélisation et Vérification

LIP6 - Laboratoire d'Informatique de Paris 6

2 LSV - Laboratoire Spécification et Vérification [Cachan]

3 MEXICO - Modeling and Exploitation of Interaction and Concurrency

LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643

Abstract : Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues. We first relate different notions of diagnosability and opacity. We consider in particular fairness issues and extend the definition of Germanos et al. [ACM TECS, 2015] of weakly fair diagnosability for safe Petri nets to general Petri nets and to opacity questions. Second, we provide a global picture of complexity results for the verification of diagnosability and opacity. We show that diagnosability is NL-complete for finite state systems, PSPACE-complete for safe Petri nets (even with fairness), and EXPSPACE-complete for general Petri nets without fairness, while non diagnosability is inter-reducible with reachability when fault events are not weakly fair. Opacity is ESPACE-complete for safe Petri nets (even with fairness) and undecidable for general Petri nets already without fairness.

Keywords : Diagnosability Opacity Verification Complexity Petri nets

Document type :

Journal articles

Domain :

Computer Science [cs] / Logic in Computer Science [cs.LO]

Liste complète des métadonnées

Cited literature [13 references] Display Hide Download

https://hal.inria.fr/hal-01852119
Contributor : Sylvain Schmitz <>
Submitted on : Tuesday, July 31, 2018 - 5:13:12 PM
Last modification on : Wednesday, March 27, 2019 - 1:34:33 AM
Document(s) archivé(s) le : Thursday, November 1, 2018 - 2:11:12 PM

bhss-fi.pdf

Files produced by the author(s)

The Complexity of Diagnosability and Opacity Verification for Petri Nets

File

Identifiers

Collections

Citation

Export

Metrics

559

46

Contact

The Complexity of Diagnosability and Opacity Verification for Petri Nets

File

Identifiers

Collections

Citation

Export

Share

Metrics

559

46

Contact