Grastien Alban, Anbulagan, Jussi Rintanen, Elena Kelareva
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 behaviors are normal or faulty. We show how the diagnosis problems can be translated into the propositional satisfiability problem (SAT) and solved by algorithms for SAT. Our experiments demonstrate that current SAT algorithms can solve much bigger diagnosis problems than traditional diagnosis algorithms can.
Subjects: 1.5 Diagnosis; 15.9 Theorem Proving
Submitted: Apr 24, 2007