摘要
可达树是Petri网性能分析的重要工具之一。本文在可达树和网结构的基础上,提出了一种分析与检测动态死锁的新方法,并给出了相应的算法。
The reachability tree is an important tool to analyze the properties of Petri Net.On the basis of reachability tree and net structure,a new analysis method for the dynamic deadlock test was advanced ,and the algorithm was given in this paper.
出处
《广西工学院学报》
CAS
1998年第1期25-29,共5页
Journal of Guangxi University of Technology
关键词
PETRI网
死锁
可达树
算法
Petri Net
Deadlock
Reachability tree
Algorithm