%0 Journal Article
%T AN ALGORITHM. FOR CONSTRUCTING A. BOUNDED PETRJ NET ACCORDING TO ITS REACHABLE MARKING-GRAPH<br>有界Petri网的可达图到网图的转换算法
%A Wu ZheHui
%A jiang Changjun
%A <br>吴哲辉
%A 蒋昌俊
%J 软件学报
%D 1992
%I 
%X 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.
%K 可达图
%K 网图
%K 算法
%K Petri网
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=E550F2940F6978065A1880C7C72C3F82&yid=F53A2717BDB04D52&vid=38B194292C032A66&iid=CA4FD0336C81A37A&sid=EA389574707BDED3&eid=771469D9D58C34FF&journal_id=1000-9825&journal_name=软件学报&referenced_num=4&reference_num=5