IEEE Transactions on Automatic Control, Vol.47, No.9, 1491-1495, 2002
Polynomial-time verification of diagnosability of partially observed discrete-event systems
The problem of verifying the properties of diagnosability and I-diagnosability is considered. We present new polynomial-time algorithms for deciding diagnosability and I-diagnosability. These algorithms are based on the construction of a nondeterministic automaton called a verifier.
Keywords:computational complexity;diagnosability verification;discrete-event systems;failure diagnosis