Title :
Polynomial-time verification of diagnosability of partially observed discrete-event systems
Author :
Yoo, Tae-Sic ; Lafortune, Stéphane
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
fDate :
9/1/2002 12:00:00 AM
Abstract :
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 :
automata theory; computational complexity; discrete event systems; fault diagnosis; finite state machines; computational complexity; diagnosability; discrete event systems; failure diagnosis; finite-state automaton model; nondeterministic automaton; regular languages; Automata; Automatic testing; Discrete event systems; Energy management; Observability; Polynomials; State-space methods; System testing;
Journal_Title :
Automatic Control, IEEE Transactions on
DOI :
10.1109/TAC.2002.802763
