Diagnosis of discrete-event systems using satisfiability algorithms
Date
2007
Authors
Grastien, Alban
Anbulagan, Anbu
Rintanen, Jussi
Kelareva, Elena
Journal Title
Journal ISSN
Volume Title
Publisher
AAAI Press
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.
Description
Keywords
Algorithms, Computational methods, Discrete event simulation, Propositional satisfiability problem, SAT, Satisfiability algorithms, Traditional diagnosis algorithms, Artificial intelligence
Citation
Collections
Source
Proceedings of the 22nd AAAI Conference on Artificial Intelligence
Type
Conference paper
Book Title
Entity type
Access Statement
License Rights
DOI
Restricted until
2037-12-31
Downloads
File
Description