Diagnosis of discrete-event systems using satisfiability algorithms

  • Authors:
  • Alban Grastien;Anbulagan Anbulagan;Jussi Rintanen;Elena Kelareva

  • Affiliations:
  • NICTA & Australian National University, Canberra, Australia;NICTA & Australian National University, Canberra, Australia;NICTA & Australian National University, Canberra, Australia;University of Melbourne, Melbourne, Australia

  • Venue:
  • AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.