基于有限容量库所方法的死锁防止算法

针对变迁均可控、可观的推广Petri网,给出了一种防止死锁的算法.该算法基于将死锁防止问题转化为控制规范的迭代算法和将控制规范施加到被控对象上的有限容量库所方法.它相对于只能面向某一类网的死锁防止方法,在通用性上有了很大改进;而且设计的控制器是结构型的,在线计算少、执行快;不过由于是迭代算法,有时离线计算量较大.最后用一个示例说明了该算法,并进行了进一步的讨论.

Finite Capacity Place Method Based Deadlock Prevention Algorithm

Given a generalized Petri net of which the transitions are all controllable and observable, a deadlock prevention algorithm is proposed in this paper. The algorithm is based on the reported iterative algorithm, which transforms deadlock prevention problems to control specifications, and the finite capacity place method, which enforces control specifications on plants. Compared with the reported methods that can only deal with some kind of Petri nets, the proposed algorithm is more general. Since the designed controller is a structural one, there is less online computation and faster execution. However, the offline computation is sometimes complex due to the iterative algorithm. Finally an example is presented to illustrate the algorithm and some further discussions are also offered.