引用本文: | 李绍勇,王安荣.应用必需信标的Petri网死锁预防策略[J].控制理论与应用,2011,28(6):771~780.[点击复制] |
LI Shao-yong,WANG An-rong.A deadlock prevention policy in Petri nets using necessary siphons[J].Control Theory and Technology,2011,28(6):771~780.[点击复制] |
|
应用必需信标的Petri网死锁预防策略 |
A deadlock prevention policy in Petri nets using necessary siphons |
摘要点击 2195 全文点击 1668 投稿时间:2010-03-18 修订日期:2010-06-25 |
查看全文 查看/发表评论 下载PDF阅读器 |
DOI编号 10.7641/j.issn.1000-8152.2011.6.CCTA100262 |
2011,28(6):771-780 |
中文关键词 Petri网 死锁预防 混合整数规划 必需信标 |
英文关键词 Petri nets deadlock prevention mixed integer programming(MIP) necessary siphons |
基金项目 国家自然科学基金资助项目(60773001, 61074035, 61064003); 教育部高等学校博士点基金资助项目(20090203110009); 国家高科技发展规划“863”计划资助项目(2008AA04Z109); 西安电子科技大学基本科研业务费资助项目; Alexander von Humboldt Foundation研究基金资助项目. |
|
中文摘要 |
本文提出了表征一个Petri网子类, 即S4R网(system of sequential systems with shared resources)中死锁问题的必需信标的概念和一种将混合整数规划算法与必需信标控制相结合的死锁预防策略. 在该策略的迭代过程中, 混合整数规划算法发现被控的Petri网中是否存在最大的死标识信标, 若存在, 则通过库所分类和迭代式的信标提取,得到必需信标, 添加相应的控制库所, 满足必需信标的最大可控性, 从而实现被控的Petri网活性的目的. 理论分析和算例验证表明了该策略的正确性和有效性. |
英文摘要 |
This paper puts forward the concept of necessary siphons that characterizes the deadlock problem in a subclass of Petri nets S4R(system of sequential systems with shared resources) and a deadlock prevention policy combining the mixed integer programming(MIP) and the control of necessary siphons. In the iteration of the proposed policy, the MIPbased deadlock-detection method explores whether a maximal deadly marked siphon exists in the controlled Petri net; if it is, this siphon is identified by the method of classification of places, and extracted as a necessary siphon to be controlled. A proper control place(CP) is applied to the necessary siphon to make it max-controlled, thus, ensuring the liveness of the controlled Petri nets. Theoretical analysis and an experimental example show the efficacy of the proposed policy. |