Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets

Masahiro YAMAUCHI  Toshimasa WATANABE  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E82-A    No.11    pp.2558-2565
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,  polynomial time solvability,  NP-completeness,  strongly connectedness,  

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

Given a Petri net N=(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 one or more minimal siphons containing a given specified set Q of places, the paper shows several results on polynomial time solvability and NP-completeness, mainly for the case |Q| 1.