The Complexity of Diagnosability and Opacity Verification for Petri Nets - Archive ouverte HAL Access content directly
Journal Articles Fundamenta Informaticae Year : 2018

The Complexity of Diagnosability and Opacity Verification for Petri Nets

(1, 2) , (3, 2) , (2) , (3, 2)
1
2
3

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.
Fichier principal
Vignette du fichier
bhss-fi.pdf (447.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01852119 , version 1 (31-07-2018)

Identifiers

Cite

Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundamenta Informaticae, 2018, 161 (4), pp.317--349. ⟨10.3233/FI-2018-1706⟩. ⟨hal-01852119⟩
200 View
142 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More