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 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.
|Collections||ANU Research Publications|
|Source:||Proceedings of the 22nd AAAI Conference on Artificial Intelligence|
|01_Grastien_Diagnosis_of_discrete-event_2007.pdf||50.96 kB||Adobe PDF||Request a copy|
|02_Grastien_Diagnosis_of_discrete-event_2007.pdf||457.42 kB||Adobe PDF||Request a copy|
|03_Grastien_Diagnosis_of_discrete-event_2007.pdf||295.34 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.