2015 23rd Mediterranean Conference on Control and Automation (MED) 2015
DOI: 10.1109/med.2015.7158746
|View full text |Cite
|
Sign up to set email alerts
|

Sensors selection for K-diagnosability of Petri nets via Integer Linear Programming

Abstract: This paper studies the problem of static sensor selection for ensuring K-diagnosability in bounded Petri nets. An integer linear programming problem is formulated to determine the minimal number of randomly selected sensors that make K-diagnosable net system with respect to a fault. This value is an estimate of the minimum number of sensors that assures the K-diagnosability of a given fault, which can be further improved taking into account some elements of the net structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 10 publications
0
10
0
Order By: Relevance
“…In (Basile, Tommasi and Sterle 2015) an Integer Linear Programming to find a minimal set of sensors of PN is presented to detect faults in at most k observations after their occurrence (k-diagnosable) ; in (Ran, Su, Giua and Seatzu, 2018) a verifier net is presented to make a codiagnosability analysis of bounded nets in decentralized PN models.…”
Section: Fault Diagnosis Of Des Have Been Widelymentioning
confidence: 99%
See 2 more Smart Citations
“…In (Basile, Tommasi and Sterle 2015) an Integer Linear Programming to find a minimal set of sensors of PN is presented to detect faults in at most k observations after their occurrence (k-diagnosable) ; in (Ran, Su, Giua and Seatzu, 2018) a verifier net is presented to make a codiagnosability analysis of bounded nets in decentralized PN models.…”
Section: Fault Diagnosis Of Des Have Been Widelymentioning
confidence: 99%
“…On other hands, in (Ran, Giua and Seatzu, 2019) new sensors are added to enforce the diagnosability to labelled PN under a new labelling function that implies detect faults in at most k observations after their occurrence, based on works of (Basile, Tommasi and Sterle 2015) and (Ran, Su, Giua and Seatzu, 2018), although it can cope with the state explosion problem of both works and considers a Integer Lineal Problem instead of graph analysis, it implies two algorithms to obtain the k parameter using an automaton.…”
Section: Fault Diagnosis Of Des Have Been Widelymentioning
confidence: 99%
See 1 more Smart Citation
“…Case (2) means that a fault has certainly occurred, thus the second condition of Denition 4.1 does not hold.…”
Section: Algorithm 62 [Computation Of the Brd]mentioning
confidence: 99%
“…More recently a series of interesting contributions have been proposed using Petri nets (PNs) [21,11,22,23,16,13,4,6,2].…”
Section: Introductionmentioning
confidence: 99%