.png){kind=icon}
.png){kind=icon}
Return
Robust Diagnosability Analysis Using Basis Reachability Graph
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3236963.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Discrete-event systems
diagnosability
basis reachability graph
robust diagnosability