Skip navigation
Skip navigation

Diagnosis of discrete-event systems using satisfiability algorithms

Grastien, Alban; Anbulagan, Anbu; Rintanen, Jussi; Kelareva, Elena


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.

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
Source: Proceedings of the 22nd AAAI Conference on Artificial Intelligence


File Description SizeFormat Image
01_Grastien_Diagnosis_of_discrete-event_2007.pdf50.96 kBAdobe PDF    Request a copy
02_Grastien_Diagnosis_of_discrete-event_2007.pdf457.42 kBAdobe PDF    Request a copy
03_Grastien_Diagnosis_of_discrete-event_2007.pdf295.34 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator