.png){kind=icon}
返回
Robust Diagnosability Analysis Using Basis Reachability Graph
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3236963.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Fault-freeness is one of the necessary guarantees for healthy and stable operations of discrete event systems. Traditional diagnostic models may fail since sensors may suffer electronic component failures, communication failures, or atmospheric electromagnetic interference. Robust diagnosis problem has attracted more and more attention since it improves reliability of the diagnosis technology. When generating the Petri net reachability graph necessary for constructing a reachability diagnoser, one may face the state explosion problem. As a Petri net gets more complicated, the complexity of its reachability graph also increases exponentially. With the basis reachability graph, a lightweight diagnoser named a basis reachability diagnoser is developed, together with a robust basis reachability diagnoser obtained by dilating the basis reachability graph. Compared with reachability graphs, the advantages of basis reachability graphs in construction complexity are confirmed and the efficiency in robust diagnosability analysis is improved.
Keyword:
Discrete-event systems
diagnosability
basis reachability graph
robust diagnosability
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets一种利用验证者网进行Petri网可诊断性分析的新方法OAAI
OAAI分享收藏分享收藏分享收藏
查看更多内容