Art

J-GLOBAL ID：201102266526862651   Reference number：11A1937766

Verifying Structurally Weakly Persistent Net Is Co-NP Complete

構造的に弱く永続的なネットについて確かめるのはCo-Np完全である

Author (2)： OHTA Atsushi (Fac. of Information Sci. and Technol., Aichi Prefectural Univ.) ,  TSUJI Kohkichi (Fac. of Information Sci. and Technol., Aichi Prefectural Univ.)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E94-A  Issue： 12  Page： 2832-2835 (J-STAGE)  Publication year： 2011 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *Petri net ,  modeling ,  NP complete problem ,  computation theory ,  Time ,  cost ,  calculation cost
Semi thesaurus term： *polynomial time

JST classification (1)： Computer utilization technology in general  (JE01000C)

Reference (10)：

• MURATA, T. Petri nets : Properties, analysis and applications. Proc. IEEE. 1989, 77, 4, 541-580
• JONES, N. D. Complexity of some problems in Petri nets. Theor. Comput. Sci. 1977, 4, 277-299
• OHTA, A. POC net, a subclass of Petri nets, and its application to timed Petri nets. Int. J. Syst. Sci. 1993, 24, 3, 539-552
• HOWELL, R. R. Normal and sinkless petri nets. J. Comput. Syst. Sci. 1993, 46, 1-26
• OHTA, A. Computational complexity of liveness problem of normal Petri net. IEICE Trans. Fundamentals, A. 2009, E92, 11, 2717-2722

Terms in the title (1)： ネット