引用本文:李绍勇,孙智冬,蔡颖,厚彩琴,韩喜莲,马兵善.应用控制变迁的柔性制造系统死锁控制策略[J].控制理论与应用,2019,36(5):795~802.[点击复制]
LI Shao-yong,SUN Zhi-dong,CAI Ying,HOU Cai-qin,HAN Xi-lian,MA Bing-shan.Deadlock control policy using control transitions for flexible manufacturing systems[J].Control Theory and Technology,2019,36(5):795~802.[点击复制]
应用控制变迁的柔性制造系统死锁控制策略
Deadlock control policy using control transitions for flexible manufacturing systems
摘要点击 2084  全文点击 983  投稿时间：2017-11-01  修订日期：2018-09-13
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  10.7641/CTA.2018.70794
  2019,36(5):795-802
中文关键词  柔性制造系统  Petri网  死锁控制策略  控制变迁  最大可达数
英文关键词  Flexible manufacturing system (FMS)  Petri net  deadlock control policy (DCP)  control transition (CT)  maximally reachable number (MRN)
基金项目  国家自然科学基金
作者单位E-mail
李绍勇* 兰州理工大学 lishaoyong99@163.com 
孙智冬 兰州理工大学  
蔡颖 兰州理工大学  
厚彩琴 兰州理工大学  
韩喜莲 兰州理工大学  
马兵善 兰州理工大学  
中文摘要
      不同于目前许多文献中基于添加控制库所的死锁预防策略, 本文提出了控制变迁方程(control transition equation, CTE)的概念和相应的基于添加控制变迁(control transition, CT)的死锁控制策略(deadlock control policy,DCP). 通过分析存在死锁的原网(N0, M0)的可达图(reachability graph, RG), 该DCP求解出所有死锁标识(deadlock marking, DM). 基于CTE, 构造出所需的控制变迁. 然后, 对每个DM添加相应的CT, 进而消除了原网(N0, M0)中的死锁标识, 得到了活性受控网系统(N*,M*). 通过理论分析和相关算例的应用, 该DCP的正确性和有效性得到了验证. 此外, 该DCP获取的(N*,M*)可达数目与(N0,M0)是相同的, 即最大可达数(maximally reachable number, MRN).
英文摘要
      Unlike the deadlock prevention policies by adding control places (CPs) in most existing literature, this paper proposes a concept of control transition equation (CTE) and the corresponding deadlock control policy (DCP) by adding control transitions (CTs). By analyzing the reachability graph (RG) of an original net (N0, M0) with deadlocks, all deadlock markings (DMs) are found by this DCP. The desired CTs are constructed on the basis of the proposed CTE. Accordingly, the corresponding CT is added to each DM in order to make all DMs in (N0, M0) eliminated. So a live controlled system (N*,M*) is obtained. The correctness and efficiency of the proposed DCP is verified via the theoretical analysis and the relevant examples. Moreover, the reachable number of (N*,M*) obtained by the proposed DCP is the same as that of (N0,M0), i. e., maximally reachable number (MRN).