检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李绍勇[1] 孙智冬 蔡颖[1] 厚彩琴[1] 韩喜莲[1] 马兵善[1] LI Shao-yong;SUN Zhi-dong;CAI Ying;HOU Cai-qin;HAN Xi-lian;MA Bing-shan(School of Civil Engineering,Lanzhou University of Technology,Lanzhou Gansu 730050,China)
机构地区:[1]兰州理工大学土木工程学院
出 处:《控制理论与应用》2019年第5期795-802,共8页Control Theory & Applications
基 金:国家自然科学基金项目(61364004);国家出国留学人员基金项目([2014]5049,201408625045);兰州理工大学博士研究基金项目(B04–237);兰州理工大学建工七七基金项目(TM–QK–1301)资助~~
摘 要:不同于目前许多文献中基于添加控制库所的死锁预防策略,本文提出了控制变迁方程(CTE)的概念和相应的基于添加控制变迁(CT)的死锁控制策略(DCP).通过分析存在死锁的原网(N0;M0)的可达图(RG),该DCP 求解出所有死锁标识(DM).基于CTE,构造出所需的控制变迁.然后,对每个DM添加相应的CT,进而消除了原网(N0;M0)中的死锁标识,得到了活性受控网系统(N*;M*).通过理论分析和相关算例的应用,该DCP的正确性和有效性得到了验证.此外,该DCP获取的活性受控网系统(N*;M*)可达数目与原网(N0;M0)是相同的,即最大可达数(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 the original net (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 in the existing literature. Moreover, the reachable number of the live controlled system (N *;M*) obtained by the proposed DCP is the same as that of the original net (N0;M0 ), i. e., maximally reachable number (MRN).
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249