基于标签时间Petri网最小初始状态的实时系统初始资源配置  

Initial resource allocation of real-time systems based on minimum initial states of labeled time Petri nets

作　　者：王琛 黎良 刘斌[1] WANG Chen;LI Liangy;LIU Bin(School of Information Science and Engineering,Wuhan University of Science and Technology,Wuhan Hubei 430081,China)

机构地区：[1]武汉科技大学信息科学与工程学院,湖北武汉430081

出　　处：《控制理论与应用》2024年第11期2103-2111,共9页Control Theory & Applications

基　　金：湖北省自然科学基金项目(2021CFB036);国家自然科学基金项目(62303359)资助.

摘　　要：针对实时系统完成特定任务序列的最少初始资源配置问题,本文研究了一种基于标签时间Petri网最小初始状态估计的解决方法.首先,对现有的标签Petri网的极小初始标识估计算法进行分析并提出改进方法,以适用于标签时间Petri网的极小初始标识的计算.其次,介绍一种基于路径(即变迁序列)的修正状态类图(MSCG).通过求解由路径MSCG的时间约束构建的线性规划问题,判定与极小初始状态相关的变迁序列是否与给定的时间标签序列一致.在此基础上,求出与时间标签序列相一致的极小初始状态集,并找出极小初始状态集中token总数最少的最小初始状态.最后,利用实例验证了所提方法的可行性和有效性.To solve the problem of minimum initial resource allocation for completing a specific sequence of tasks in a real-time system,this paper proposes a method based on the minimum initial state estimation of labeled time Petri nets.By improving the minimal initial marking(MIM)estimation algorithm of a labeled Petri net,an algorithm for estimating the MIMs in a labeled time Petri net is presented.Then,a path(i.e.,a transition sequence)modified state class graph(MSCG)is reported.By solving a set of linear programming problems associated with the timing constraints in the path MSCG,this paper determines which logic transition sequences associated with minimal initial states are consistent with the given time label sequence(TLS),so as to find the set of minimal initial states consistent with the TLS.Furthermore,the set of minimum initial states with the minimum total number of tokens is calculated.Finally,the feasibility and effectiveness of the proposed method are verified by an example.

关 键 词：离散事件系统 资源配置 时间PETRI网 状态类图 状态估计 

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