Masahiro YAMAUCHI


Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets
Satoru OCHIIWA Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/02/01
Vol. E96-A  No. 2  pp. 540-553
Type of Manuscript:  Special Section PAPER (Special Section on Mathematical Systems Science and its Applications)
Category: Algorithms and Data Structures
Keyword: 
timed Petri netslegal firing sequence problemsdeficient siphonsheuristic algorithmsperformance evaluation
 Summary | Full Text:PDF

Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets
Satoru OCHIIWA Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/11/01
Vol. E92-A  No. 11  pp. 2732-2744
Type of Manuscript:  Special Section PAPER (Special Section on Theory of Concurrent Systems and its Applications)
Category: 
Keyword: 
Petri netslegal firing sequence problemsdeficient siphonsheuristic algorithmsperformance evaluation
 Summary | Full Text:PDF

Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets
Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/11/01
Vol. E88-A  No. 11  pp. 3051-3061
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent/Hybrid Systems: Theory and Applications)
Category: 
Keyword: 
Petri netsminimal initial marking problemslegal firing sequence problemsdeficient siphonsheuristic algorithmsexperimental evaluation
 Summary | Full Text:PDF

Experimental Evaluation of Two Algorithms for Computing Petri Net Invariants
Katsushi TAKANO Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/11/01
Vol. E84-A  No. 11  pp. 2871-2880
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent Systems Technology)
Category: 
Keyword: 
Petri netminimal siphon-trapsFourier-Motzkin methodmemory overflow
 Summary | Full Text:PDF

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 netminimal siphonsbranch-and-bound algorithmssiphon extraction
 Summary | Full Text:PDF

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

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

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 netsminimal siphonspolynomial-time algorithmsstrongly connectedneddNP-completeness
 Summary | Full Text:PDF

Priority-List Scheduling in Timed Petri Nets
Takenobu TANIDA Toshimasa WATANABE Masahiro YAMAUCHI Kinji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/10/25
Vol. E75-A  No. 10  pp. 1394-1406
Type of Manuscript:  Special Section PAPER (Special Section on Application of Petri Nets to Concurrent System Design)
Category: 
Keyword: 
schedulingpriority-listsapproximation algorithmstimed Petri nets
 Summary | Full Text:PDF

The Minimum Initial Marking Problem for Scheduling in Timed Petri Nets
Toshimasa WATANABE Takenobu TANIDA Masahiro YAMAUCHI Kenji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/10/25
Vol. E75-A  No. 10  pp. 1407-1421
Type of Manuscript:  Special Section PAPER (Special Section on Application of Petri Nets to Concurrent System Design)
Category: 
Keyword: 
timed Petri netsschedulingapproximation algorithmstime complexityNP-hardness
 Summary | Full Text:PDF