Art

J-GLOBAL ID：200902128046099840   Reference number：00A0402911

On the Legal Firing Sequence Problem of Petri Nets with Cactus Structure.

カクタス構造をもつペトリネットの発火系列問題

Author (3)： FUJITO T (Nagoya Univ., Nagoya-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： E83-A  Issue： 3  Page： 480-486  Publication year： Mar. 25, 2000 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *Petri net ,...
Semi thesaurus term： computational complexity

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

JST classification (1)： Basics of graph theory  (IA02020S)

Reference (10)：

• KOSARAJU, R. Decidability of reachability in vector addition systems. Proc. 14th Annual ACM Symp. on Theory of Computing. 1982, 267-280
• LANDWEBER, L. H. Properties of conflict - free and persistent Petri nets. J. Assoc. Comput. Mach. 1978, 25, 3, 352-364
• MAYR, E. W. An algorithm for the general Petri net reachability problem. SIAM J. Comput. 1984, 13, 441-460
• MORITA, K. The legal firing sequence problem of Petri nets with state machine structure. Proc. 1996 IEEE International Symposium on Circuits and Systems. 1996, 64-67
• PETERSON, J. L. Petri Net Theory and the Modeling of Systems. 1981

Terms in the title (3)： ペトリネット ,  発火 ,  系列