Sensors selection for K-diagnosability of Petri nets via Integer Linear Programming
Francesco Basile, G. De Tommasi, Claudio Sterle · 2015
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.