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网/状态类图/状态估计
Key words
discrete event system/resource allocation/time Petri net/state class graph/state estimation
维普
万方数据