Art
J-GLOBAL ID：200902051976739146   Reference number：84A0479704

An algorithm for the general Petri net reachability problem.

一般ペトリネットの到達可能性問題に対する1アルゴリズム
Author (1)：
MAYR E W

About MAYR E W

(Stanford Univ., California)

About Stanford Univ., California


Material：
SIAM Journal on Computing (Society for Industrial and Applied Mathematics)  (SIAM J Comput (Soc Ind Appl Math))

About SIAM Journal on Computing (Society for Industrial and Applied Mathematics)


Volume： 13  Issue： 3  Page： 441-460  Publication year： Aug. 1984 
JST Material Number： D0944A  ISSN： 0097-5397  CODEN： SMJCAT  Document type： Article
Article type： 原著論文  Country of issue： United States (USA)  Language： ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
Petri net

About Petri net

,...
Semi thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
computational complexity

About computational complexity


   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=84A0479704&from=J-GLOBAL&jstjournalNo=D0944A") }}
JST classification (1)：
JST classification
Category name(code) classified by JST.
Theory of computation 
(JB02000A)

About Theory of computation

Terms in the title (3)：
Terms in the title
Keywords automatically extracted from the title.
ペトリネット

About ペトリネット

, 
到達可能性

About 到達可能性

, 
アルゴリズム

About アルゴリズム


Return to Previous Page

TOP

BOTTOM