Complete enumeration of minimal siphons in ordinary Petri nets based on problem partitioning

A siphon is a structural object in Petri nets that is important both from a theoretical and a practical point of view. Particularly, the performance of siphon-based deadlock control policies largely depends on siphon enumeration. This work studies complete minimal-siphon enumeration in ordinary Petri nets. A recent approach, called global partitioning minimal-siphon enumeration (GPMSE) has been recently proposed by Cordone et al. [1] and provides good performance compared with other methods. In this paper we show that further improvements are possible and we propose a novel approach, called improved GPMSE, which requires lower computational complexity and memory consumption than the original method, especially for nets with large size. Experimental results are presented to validate the above claim.