摘要
存储结构及算法是 Petri网仿真和自动化分析研究中的重要内容 .Petri网是一种特殊的有向图 ,通过对图的存储问题进行研究 ,提出了一种有向图的存储结构——树链式结构 ,给出了其构造算法 .与其它有向图存储结构相比 ,它既可提高算法速度又能降低算法复杂性 .树链式结构在 Petri网仿真和自动化分析中应用优势明显 ,着重讨论了 Petri网的树链式存储结构 ,提出了基于该存储结构的可达树生成算法 .所生成的可达树的树链结构形式 ,利于展开 Petri网的各种分析算法 .
Storage structure and algorithm are important to Petri net's simulation and automatization analysis. Petri net is a type of directed graph. Through studying the problem of graph's storage, a directed graph's data structure named tree-chain structure is put forward, and its construction algorithm is given. Comparing to other storage structures of directed graph, it can improve the speed and decrease the complexity of the algorithm. The tree-chain structure is very suitable for the application in simulation and automatization analysis of Petri net, so the tree-chain structure of Petri net is emphasized in this paper. Then the generation algorithm of reachability tree based on the tree-chain structure is presented. The tree-chain structure of the reachability tree is beneficial to expanding various analysis algorithms of Petri net.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2002年第9期1106-1112,共7页
Journal of Computer Research and Development
基金
空军科技人才培养基金资助
关键词
PETRI网
仿真
自动化分析
存储结构
算法
有向图
可达树
树链式结构
Petri net, simulation, automatization analysis, storage structure, algorithm, directed graph, reachability tree
