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.
Published in:
Automatic Control, IEEE Transactions on
(Volume:47
,
Issue:
9
)
Date of Publication: Sep 2002