Art
J-GLOBAL ID：200902042623147556   Reference number：91A0551139

A Polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets.

1-有界コンフリクト-フリーPetriネットのためのトランジションの一対の並行性を決定するための多項式時間アルゴリズム
Author (1)：
YEN H-C

About YEN H-C

(National Taiwan Univ., Taipei, TWN)

About National Taiwan Univ., Taipei, TWN


Material：
Information Processing Letters  (Inf Process Lett)

About Information Processing Letters


Volume： 38  Issue： 2  Page： 71-76  Publication year： Apr. 26, 1991 
JST Material Number： E0513A  ISSN： 0020-0190  Document type： Article
Article type： 短報  Country of issue： Netherlands (NLD)  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.
concurrent processing

About concurrent processing

,...
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=91A0551139&from=J-GLOBAL&jstjournalNo=E0513A") }}
JST classification (1)：
JST classification
Category name(code) classified by JST.
Theory of computation 
(JB02000A)

About Theory of computation

Terms in the title (6)：
Terms in the title
Keywords automatically extracted from the title.
有界

About 有界

, 
コンフリクト

About コンフリクト

, 
Petriネット

About Petriネット

, 
トランジション

About トランジション

, 
並行

About 並行

, 
多項式時間アルゴリズム

About 多項式時間アルゴリズム


Return to Previous Page

TOP

BOTTOM