Sensor Selection for event-detectability in Interpreted Petri Nets using an Ant Colony Optimization algorithm

Abstract

This paper addresses the minimal cost sensor selection problem for event-detectability in Interpreted Petri Nets (IPN) models of Discrete Event Systems (DES). The computational complexity of this problem is reduced using an Ant Colony Optimization (ACO) algorithm. The proposed algorithm takes advantage of a structural characterization of the event-detectability property and can be tested in a polynomial time. The presented ACO algorithm is quite simple and helps to reduce the design effort of a DES.