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.

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

BASILE, FRANCESCO;
2015

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.
9781479999361
9781479999361
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11386/4655362
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 5
social impact