信标可控性定义及问题  

Siphon Controllability Definitions and Issues

作　　者：尤丹[1] 王寿光[1] 周孟初 

机构地区：[1]浙江工商大学信息与电子工程学院,杭州310018 [2]同济大学教育部嵌入式系统与服务计算重点实验室,上海201804 [3]美国新泽西理工学院电子与计算机工程系,美国纽瓦克市NJ07102

出　　处：《自动化学报》2014年第12期2687-2696,共10页Acta Automatica Sinica

基　　金：国家自然科学基金(61472361,61100056,61374148);浙江省杰出青年基金(LR14F020001);浙江省科技计划(2013C31111);浙江省新型网络标准与应用技术重点实验室项目(2013E10012);浙江工商大学创新项目(CX201411010)资助~~

摘　　要：死锁是资源分配系统中极不希望出现的现象,目前死锁控制的一个重要的方法是信标控制法,信标控制法的基础是信标可控性的定义.对于普通Petri网,已有一个完善的信标可控性定义,而对于一般Petri网,这方面的工作还需改进和完善.近年来,学者们针对一般Petri网及其子类提出了不少信标可控性定义,但这些定义并不完善,仍有大量的问题亟待解决.首先回顾了文献中的各个信标可控性定义,提出了两个新的信标可控性定义,然后从可控性定义的宽松程度、应用范围以及等价性等方面分析比较了现有的信标可控性定义优缺点.最后给出了今后的研究方向.Deadlocks are an extremely undesirable situation in resource allocation systems. Nowadays, siphon control, which is based on siphon controllability conditions, is one of the important methods to ensure that deadlocks never occur in systems. For ordinary Petri nets, the siphon controllability condition is well defined. However, it remains an open question for generalized Petri nets despite many attempts to define their siphon controllability conditions. In recent years, many such conditions have been proposed for them or their subclasses, but suffer from various problems. This paper surveys the existing siphon controllability conditions and then presents two new ones. All of them are compared in terms of their condition strictness, application scope and equivalence. ~ture research directions are also indicated.

关 键 词：PETRI网 活性 信标 可控性 

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