Keyword : minimal siphons

Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets
Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1999/11/25
Vol. E82-A  No. 11 ; pp. 2558-2565
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent Systems Technology)
Category: 
Keyword: 
Petri net, minimal siphons, polynomial time solvability, NP-completeness, strongly connectedness, 
 Summary | Full Text:PDF(585.6KB)
Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net
Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1999/11/25
Vol. E82-A  No. 11 ; pp. 2566-2575
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent Systems Technology)
Category: 
Keyword: 
Petri net, minimal siphons, branch-and-bound algorithms, siphon extraction, 
 Summary | Full Text:PDF(424.4KB)
Finding a Minimal Siphon Containing Specified Places in a General Petri Net
Masahiro YAMAUCHI Shinji TANIMOTO Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/11/25
Vol. E79-A  No. 11 ; pp. 1825-1828
Type of Manuscript:  Special Section LETTER (Special Section on Description Models for Concurrent Systems and Their Applications)
Category: 
Keyword: 
general Petri nets, minimal siphons, polynomial-time algorithms, strongly connectednedd, NP-completeness, 
 Summary | Full Text:PDF(334.6KB)
Finding Minimal Siphons in General Petri Nets
Shinji TANIMOTO Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/11/25
Vol. E79-A  No. 11 ; pp. 1817-1824
Type of Manuscript:  Special Section PAPER (Special Section on Description Models for Concurrent Systems and Their Applications)
Category: 
Keyword: 
general Petri nets, minimal siphons, polynomial-time algorithms, strongly connectedness, NP-completeness, 
 Summary | Full Text:PDF(616.4KB)