普通Petri网最大可达数的两段式死锁控制策略

发布时间：2018-03-16 00:24

本文选题：Petri网　切入点：死锁控制　出处：《控制理论与应用》2017年02期 　论文类型：期刊论文

【摘要】：针对普通Petri网的死锁问题,本文提出了可实现最大可达数的两段式死锁控制策略(deadlock control policy,DCP).第1步,该策略求解原网(N0,M0)的基本信标(elementary siphons,ES)和从属信标(dependent siphons,DS),对每个基本信标添加控制库所(control place,CP)和控制变迁(control transition,CT),获得拓展网系统(N′,M′).第2步,构建拓展网系统的P 不变式整数规划问题,测试原网中从属信标的可控性.若所有从属信标满足可控条件,则直接得到活性受控网系统(N*,M*);反之,对不满足可控条件的从属信标也添加控制库所和变迁,从而也得到了(N*,M*).通过理论分析和算例验证,表明了该死锁控制策略的正确性和有效性.相比目前文献中的可实现最大许可行为数目(number of maximally permissive behavior,NMPB)的普通Petri网死锁预防策略,该DCP获取的活性受控网系统(N*,M*)可达数目与原网(N0,M0)是相同的,且最大可达数(maximally reachable number,MRN)高于最大许可行为数目NMPB.
[Abstract]:To solve the deadlock problem of ordinary Petri nets, this paper presents a two-stage deadlock control strategy, which can achieve the maximum number of deadlocks, control policy and DCP.The first step, The strategy solves the basic beacons of N0 / M0) and dependent siphonsof the original network. It adds the control place (CPS) and the control transition control to each basic beacon, and obtains the extended network system. In the second step, the P invariant integer programming problem of the extended network system is constructed, and the P invariant integer programming problem of the extended network system is constructed in the second step, by adding the control control place (CPV) and the control transition control to each basic beacon, and then to obtain the extended network system (N0 / M0). In the second step, the P invariant integer programming problem of the extended network system is constructed. Test the controllability of the dependent beacons in the original network. If all the dependent beacons satisfy the controllable conditions, the active controlled network system can be obtained directly; conversely, the dependent beacons which do not satisfy the controllable conditions are also subject to the addition of a control base and transition. Through theoretical analysis and numerical examples, the correctness and effectiveness of the damned lock control strategy are shown. Compared with the current literature, the maximum allowable number of maximally permissive behaviors and the general Petri net deadlock prevention strategy are compared. The number of active controlled network (DCP) obtained by this DCP is the same as that of N0 (M0), and the maximum reachable number (MRN) is higher than the maximum allowable behavior (NMPB).
【作者单位】：兰州理工大学土木工程学院;开封大学电子电气工程学院;
【基金】：国家自然科学基金项目(61364004) 国家出国留学人员基金项目([2014]5049,201408625045) 兰州理工大学博士研究基金项目(B04 237);兰州理工大学建工七七基金项目(TM QK 1301)资助~~
【分类号】：TP301.1

【相似文献】