Art

J-GLOBAL ID：200902108124876629   Reference number：01A0333567

A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets.

ペトリネットの最小初期マーキング問題のための発見的アルゴリズムFMDB

Author (3)： NISHI S (Hiroshima Univ., Higashi-Hiroshima-shi, JPN) ,  TAOKA S (Hiroshima Univ., Higashi-Hiroshima-shi, JPN) ,  WATANABE T (Hiroshima Univ., Higashi-Hiroshima-shi, JPN)
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： E84-A  Issue： 3  Page： 771-780  Publication year： Mar. 01, 2001 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *Petri net ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=01A0333567&from=J-GLOBAL&jstjournalNo=F0699C") }}

JST classification (2)： Basics of graph theory  (IA02020S) ,  Network methods  (KA03040X)

Reference (16)：

• AWA, K. Heuristic algorithms for the legal firing sequence and related problems of Petri nets. IEICE Technical Report. 2000
• EVEN, S. Graph Algorithms. 1978
• GAREY, M. R. Computers and Intractability : A Guide to the Theory of NP-completeness. 1978
• HIRAISHI, K. Initial markings at which firing count vector has firable firing sequences in Petri net. The 2nd National Net Theory Workshop of IEICE of Japan. 1987, 33-40
• MURATA, T. Petri nets : Properties, analysis and applications. Proc. IEEE. 1989, 77, 541-580

Terms in the title (5)： ペトリネット ,  初期 ,  マーキング ,  問題 ,  発見的アルゴリズム