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 structure
Sensors selection for K-diagnosability of Petri nets via Integer Linear Programming / F., Basile; DE TOMMASI, Gianmaria; Sterle, Claudio. - (2015), pp. 174-181. (Intervento presentato al convegno 23rd Mediterranean Conference on Control and Automation (MED'15) tenutosi a Torremolinos, Spagna nel 16-19 Giugno) [10.1109/MED.2015.7158746].
Sensors selection for K-diagnosability of Petri nets via Integer Linear Programming
DE TOMMASI, GIANMARIA;STERLE, CLAUDIO
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 structureI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
