In: IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E82-A, No. 11, pages 2566-2575. 1999.
Abstract: Given a Petri net, a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimal siphons containing a given specified set Q of places, the paper proposes three algorithms based on the branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for extracting such one minimal siphon.
Keywords: Petri nets, branch-and-bound algorithms, minimal siphons, siphon extraction.