Diagnosis of discrete-event systems using satisfiability algorithms

Alban Grastien*, Anbulagan, Jussi Rintanen, Elena Kelareva

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    52 Citations (Scopus)

    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.

    Original languageEnglish
    Title of host publicationAAAI-07/IAAI-07 Proceedings
    Subtitle of host publication22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
    Pages305-310
    Number of pages6
    Publication statusPublished - 2007
    EventAAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference - Vancouver, BC, Canada
    Duration: 22 Jul 200726 Jul 2007

    Publication series

    NameProceedings of the National Conference on Artificial Intelligence
    Volume1

    Conference

    ConferenceAAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
    Country/TerritoryCanada
    CityVancouver, BC
    Period22/07/0726/07/07

    Fingerprint

    Dive into the research topics of 'Diagnosis of discrete-event systems using satisfiability algorithms'. Together they form a unique fingerprint.

    Cite this