Tomohiro TAKAI

Complexity and a Heuristic Algorithm of Computing Parallel Degree for Program Nets with SWITCH-Nodes
Shingo YAMAGUCHI Tomohiro TAKAI Tatsuya WATANABE Qi-Wei GE Minoru TANAKA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/11/01
Vol. E89-A  No. 11  pp. 3207-3215
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent/Hybrid Systems: Theory and Applications)
Category: Concurrent Systems
program netsparallel degreecomputation complexityNP-completeness
 Summary | Full Text:PDF(428.7KB)