AN ALGORITHM. FOR CONSTRUCTING A. BOUNDED PETRJ NET ACCORDING TO ITS REACHABLE MARKING-GRAPH
有界Petri网的可达图到网图的转换算法

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.