IEEE Transactions on Automatic Control · 2002 · 409 citations · 7 references
ComputingComputer EngineeringComputer ScienceAlgorithmsFormal MethodsTheory Of ComputationAutomata TheoryModel CheckingAutomata In Formal VerificationDiagnosabilityDiscrete-event SystemsFinite State Machine VerificationFinite-state VerificationPolynomial Time ComplexityPolynomial-time Algorithms
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.
7
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
1990 · 3.1K citations
Diagnosability of discrete-event systems
Meera Sampath, Raja Sengupta, Stéphane Lafortune et al. · IEEE Transactions on Automatic Control · 1995 · 1.6K citations