| 摘要: |
| 本文给出了有界Petri网的可达标识图到网图的转换算法,对算法的正确性与复杂性分别进行了证明和估计,结果表明该算法是一个多项式算法,因而是有效的。 |
| 关键词: |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金 |
|
| AN ALGORITHM. FOR CONSTRUCTING A. BOUNDED PETRJ NET ACCORDING TO ITS REACHABLE MARKING-GRAPH |
|
Wu ZheHui,jiang Changjun
|
| Abstract: |
| An algorithm for constructing a bounded Petri Net according to its reachable marking graph is presented in this paper. A proof of correctness and a valuation of complexity for the algorithm are also given. We show that the algorithm is of polynomial complexity, hence it is a valid algorithm. |
| Key words: |
