Article ：Browse 3317 Download 2885
Received:January 30, 1990 Revised:June 05, 1990
Received:January 30, 1990 Revised:June 05, 1990
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:
Foundation items:
| Author Name | Affiliation |
| Wu ZheHui | 山东矿业学院应用数学与软件工程系，泰安，271019 |
| jiang Changjun | 山东矿业学院应用数学与软件工程系，泰安，271019 |
Reference text:
Wu ZheHui,jiang Changjun.AN ALGORITHM. FOR CONSTRUCTING A. BOUNDED PETRJ NET ACCORDING TO ITS REACHABLE MARKING-GRAPH.Journal of Software,1992,3(1):23-29
Wu ZheHui,jiang Changjun.AN ALGORITHM. FOR CONSTRUCTING A. BOUNDED PETRJ NET ACCORDING TO ITS REACHABLE MARKING-GRAPH.Journal of Software,1992,3(1):23-29
