Marking Estimation in Petri Nets Using Hierarchical Basis Reachability Graphs

• 成果类型: Article
• 署名作者: Ma, Ziyue; Zhu, Guanghui; Li, Zhiwu
• 署名单位: Xidian University; Macau University of Science & Technology
• 刊物名称: IEEE TRANSACTIONS ON AUTOMATIC CONTROL
• ISSN/ISSBN: 0018-9286
• DOI: 10.1109/TAC.2020.2983088
• 发表日期: 2021
• 页码: 810-817
• 关键词: Basis reachability graph; discrete event system; Petri net; State estimation

摘要

In this article, we propose a two-layer-structure called hierarchical basis reachability graph that is useful for marking estimation in Petri nets that contain unobservable transitions. On the basis of a hierarchical partition of the set of observable transitions, a hierarchical basis reachability graph consists of a primary and a secondary structures. Simulation shows that the time-consumption to compute a hierarchical basis reachability graph is in general much less than that of computing the corresponding basis reachability graph. A marking estimation algorithm is proposed by the structural analysis of the corresponding hierarchical basis reachability graph.