Keyword : strongly connectedness


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 netminimal siphonspolynomial time solvabilityNP-completenessstrongly connectedness
 Summary | Full Text:PDF(585.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 netsminimal siphonspolynomial-time algorithmsstrongly connectednessNP-completeness
 Summary | Full Text:PDF(616.4KB)