Characterization of minimal and basis siphons with predicate logic and binary programming
Roberto Cordone, Luca Ferrarini, Luigi Piroddi · 2003
The paper addresses the problem of computing siphons and traps in a standard Petri net. In particular, starting from a clear formulation in terms of predicate logic, it is shown how binary programming techniques can be adopted to formulate and solve the problem of finding minimal and basis siphons. An experimental campaign on a large set of random test instances proves the effectiveness of the method when compared to a constructive one.