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.
No takes yet. Share an insight, caveat, or question.
Yoo et al. (2002) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: