Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net

Masahiro YAMAUCHI  Toshimasa WATANABE  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E82-A    No.11    pp.2566-2575
Publication Date: 1999/11/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Concurrent Systems Technology)
Petri net,  minimal siphons,  branch-and-bound algorithms,  siphon extraction,  

Full Text: PDF(424.4KB)>>
Buy this Article

Given a Petri net PN=(P, T, E), 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 branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for extracting such one minimal siphon.