The Complexity of Diagnosability and Opacity Verification for Petri Nets

Béatrice Bérard 1, 2 Stefan Haar 3, 2 Sylvain Schmitz 2 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
Type de document :
Article dans une revue
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2018, 161 (4), pp.317--349. 〈10.3233/FI-2018-1706〉
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-01852119
Contributeur : Sylvain Schmitz <>
Soumis le : mardi 31 juillet 2018 - 17:13:12
Dernière modification le : vendredi 23 novembre 2018 - 01:47:37
Document(s) archivé(s) le : jeudi 1 novembre 2018 - 14:11:12

Fichier

bhss-fi.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

ENS-CACHAN | UPMC | LIP6 | INRIA | UNIV-PARIS-SACLAY | SORBONNE-UNIVERSITE

Citation

Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2018, 161 (4), pp.317--349. 〈10.3233/FI-2018-1706〉. 〈hal-01852119〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

514

Téléchargements de fichiers

26

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD