Enforcement of Diagnosability in Labeled Petri Nets via Optimal Sensor Selection
Giua A.Penultimate
;Seatzu C.Last
2019-01-01
Abstract
In this paper, we deal with the problem of enforcing diagnosability to labeled Petri nets (PNs) appropriately adding new sensors. We show that, solving an integer linear programming problem, it is possible to select a solution that is optimal with respect to a given objective function (e.g., the cost of sensors). The solution is based on two notions, already introduced by the authors in previous works, namely basis marking and unfolded verifier. This allows to solve the considered problem in a more efficient way with respect to other approaches in the literature. Finally, we propose an algorithm to compute the smallest value of K such that the PN system is K-diagnosable under the new labeling function, which implies that faults can be detected in at most K observations after their occurrence.File | Size | Format | |
---|---|---|---|
Enforcement of diagnosability.pdf open access
Description: articolo
Type: versione post-print
Size 750.48 kB
Format Adobe PDF
|
750.48 kB | Adobe PDF | View/Open |
Enforcement_of_Diagnosability_in_Labeled_Petri_Nets_via_Optimal_Sensor_Selection.pdf Solo gestori archivio
Description: Articolo completo
Type: versione editoriale
Size 561.8 kB
Format Adobe PDF
|
561.8 kB | Adobe PDF | & nbsp; View / Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.