Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms

The diagnosis of a discrete-event system is the problem of computing possible behaviors of the system given observations of the actual behavior, and testing whether the behavi ors are normal or faulty. We show how the diagnosis problems can be translated into the propositional satisfiability pro blem (SAT) and solved by algorithms for SAT. Our experiments… CONTINUE READING

3 Figures & Tables



Citations per Year

62 Citations

Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.