###
DOI:
Journal of Software:1992.3(1):23-29

有界Petri网的可达图到网图的转换算法
吴哲辉,蒋昌俊
(山东矿业学院应用数学与软件工程系,泰安,271019)
AN ALGORITHM. FOR CONSTRUCTING A. BOUNDED PETRJ NET ACCORDING TO ITS REACHABLE MARKING-GRAPH
Wu ZheHui,jiang Changjun
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2905   Download 2633
Received:January 30, 1990    Revised:June 05, 1990
> 中文摘要: 本文给出了有界Petri网的可达标识图到网图的转换算法,对算法的正确性与复杂性分别进行了证明和估计,结果表明该算法是一个多项式算法,因而是有效的。
中文关键词:
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:
Reference text:

吴哲辉,蒋昌俊.有界Petri网的可达图到网图的转换算法.软件学报,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