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

被引:0
作者
Wang, Chen [1 ]
Li, Liang [1 ]
Liu, Bin [1 ]
机构
[1] School of Information Science and Engineering, Wuhan University of Science and Technology, Hubei, Wuhan
来源
Kongzhi Lilun Yu Yingyong/Control Theory and Applications | 2024年 / 41卷 / 11期
基金
中国国家自然科学基金;
关键词
discrete event system; resource allocation; state class graph; state estimation; time Petri net;
D O I
10.7641/CTA.2023.20968
中图分类号
学科分类号
摘要
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. © 2024 South China University of Technology. All rights reserved.
引用
收藏
页码:2103 / 2111
页数:8
相关论文
共 23 条
  • [1] YE Dandan, WU Weimin, SU Hongye, Application of labeled Petri net path information in fault diagnosis, Control and Decision, 36, 2, pp. 325-334, (2021)
  • [2] LIU Jiufu, ZHANG Zhiguo, ZHENG Rui, Et al., Fault diagnosis of bipropellant propulsion system using partially observed time Petri nets, Systems Engineering and Electronics, 40, 6, pp. 1337-1344, (2018)
  • [3] QUE Caixiong, LIU Fuchun, ZHAO Rui, Et al., Online fault diagnosis of discrete event system based on Petri net, Control Theory & Applications, 37, 7, pp. 1621-1627, (2020)
  • [4] SHU S, LIN F, YING H, Et al., State estimation and detectability of probabilistic discrete event systems, Automatica, 44, 12, pp. 3054-3060, (2008)
  • [5] LAI A, LAHAYE S, GIUA A., State estimation of max-plus automata with unobservable events, Automatica, 105, pp. 36-42, (2019)
  • [6] YIN X., Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures, Automatica, 80, pp. 127-134, (2017)
  • [7] KEROGLOU C, HADJICOSTIS C N., Verification of detectability in probabilistic finite automata, Automatica, 86, pp. 192-198, (2017)
  • [8] GIUA A, SEATZU C., Observability of place/transition nets, IEEE Transactions on Automatic Control, 47, 9, pp. 1424-1437, (2002)
  • [9] GIUA A, SEATZU C, CORONA D., Marking estimation of Petri nets with silent transitions, IEEE Transactions on Automatic Control, 52, 9, pp. 1695-1699, (2007)
  • [10] RU Y, HADJICOSTIS C., Bounds on the number of markings consistent with label observations in Petri nets, IEEE Transactions on Automation Science and Engineering, 6, 2, pp. 334-344, (2009)