基于补库所的死锁预防策略  

A Deadlock Prevention Policy Based on Complementary Places

作　　者：吴文慧[1] 王寿光[1] 

机构地区：[1]浙江工商大学信息与电子工程学院,杭州310018

出　　处：《计算机学报》2013年第11期2257-2265,共9页Chinese Journal of Computers

基　　金：国家自然科学基金(61100056);浙江省自然科学基金(LY12F03020);浙江省科技计划项目(2013C31111);浙江省新型网络标准与应用技术重点实验室(2013E10012)资助~~

摘　　要：文中基于补库所理论提出了活性控制器设计方法.首先,利用容量函数K将原Petri网N转变为有限容量网珦N,再通过逐一增加K值得到具有最大可达集的容量函数Kmax,然后根据Kmax添加一组补库所,最终得到活性受控网N′.文中首先以S3PR网模型为例,与几种经典的死锁预防控制策略进行比较.实例数据表明,基于补库所理论设计的控制器不仅结构简单,避免了信标计算,还具有较好的行为许可性.最后,以S3 PGR2网模型为例,说明基于补库所的死锁预防策略同样可以应用于一般Petri网.For Petri net models of flexible manufacturing systems, this work proposes a method to design liveness-enforcing supervisors based on complementary places. Firstly, a finite-capacity net N is obtained from a given Petri net N by adding a capacity function K. Then, by increasing K to K the maximal reachability set of live finite-capacity net N is computed and the comple- mentary-place transformation is used to obtain the live system N＇. Finally, an example of S3PR net is provided to compare with some other approaches proposed in prior work. Comparison results show that the liveness-enforcing supervisor obtained by the proposed method has simpler structure and more permissive behavior in some cases. Furthermore, another example of S3PGR2 net shows that the proposed method can be applied to the general Petri nets.

关 键 词：PETRI网 死锁 补库所控制器 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]