| 有界Petri网的可达图到网图的转换算法 |
| |
| 引用本文： | 吴哲辉,蒋昌俊. 有界Petri网的可达图到网图的转换算法[J]. 软件学报, 1992, 3(1): 23-29 |
| |
| 作者姓名： | 吴哲辉 蒋昌俊 |
| |
| 作者单位： | 山东矿业学院应用数学与软件工程系，泰安，271019;山东矿业学院应用数学与软件工程系，泰安，271019 |
| |
| 摘 要： | 本文给出了有界Petri网的可达标识图到网图的转换算法,对算法的正确性与复杂性分别进行了证明和估计,结果表明该算法是一个多项式算法,因而是有效的。
|
| 关 键 词： | 可达图 网图 算法 Petri网 |
| 收稿时间： | 1990-01-30 |
| 修稿时间： | 1990-06-05 |
AN ALGORITHM. FOR CONSTRUCTING A. BOUNDED PETRJ NET ACCORDING TO ITS REACHABLE MARKING-GRAPH |
| |
| Wu ZheHui and jiang Changjun. AN ALGORITHM. FOR CONSTRUCTING A. BOUNDED PETRJ NET ACCORDING TO ITS REACHABLE MARKING-GRAPH[J]. Journal of Software, 1992, 3(1): 23-29 |
| |
| Authors: | Wu ZheHui and 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. |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
