The Complexity of Diagnosability and Opacity Verification for Petri Nets

Béatrice Bérard 1, 2 Stefan Haar 3, 2 Sylvain Schmitz 4, 2 Stefan Schwoon 3, 2
1 MoVe - Modélisation et Vérification
LIP6 - Laboratoire d'Informatique de Paris 6
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
4 DAHU - Verification in databases
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.
Type de document :
Communication dans un congrès
van der Aalst, Wil and Best, Eike. Petri nets 2017, 2017, Zaragoza, Spain. Springer, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/hal-01484476
Contributeur : Sylvain Schmitz <>
Soumis le : mardi 7 mars 2017 - 12:06:53
Dernière modification le : jeudi 9 mars 2017 - 01:10:54

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01484476, version 1

Citation

Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. van der Aalst, Wil and Best, Eike. Petri nets 2017, 2017, Zaragoza, Spain. Springer, Lecture Notes in Computer Science. <hal-01484476>

Partager

Métriques

Consultations de
la notice

105

Téléchargements du document

30