Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Diagnosis of discrete-event systems using satisfiability algorithms

Simple item page
dc.contributor.authorGrastien, Alban
dc.contributor.authorAnbulagan, Anbu
dc.contributor.authorRintanen, Jussi
dc.contributor.authorKelareva, Elena
dc.contributor.editorHolte, R. C.
dc.contributor.editorHowe, A. E.
dc.coverage.spatialVancouver Canada
dc.date.accessioned2015-12-08T22:41:45Z
dc.date.createdJuly 22-26 2007
dc.date.issued2007
dc.date.updated2022-08-07T08:19:50Z
dc.description.abstractThe 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.
dc.identifier.isbn9781577353232
dc.identifier.urihttp://hdl.handle.net/1885/36782
dc.publisherAAAI Press
dc.relation.ispartofseriesNational Conference on Artificial Intelligence (AAAI 2007)
dc.sourceProceedings of the 22nd AAAI Conference on Artificial Intelligence
dc.source.urihttp://www.aaai.org/Library/AAAI/aaai07contents.php
dc.subjectAlgorithms
dc.subjectComputational methods
dc.subjectDiscrete event simulation
dc.subjectPropositional satisfiability problem
dc.subjectSAT
dc.subjectSatisfiability algorithms
dc.subjectTraditional diagnosis algorithms
dc.subjectArtificial intelligence
dc.titleDiagnosis of discrete-event systems using satisfiability algorithms
dc.typeConference paper
local.bibliographicCitation.lastpage310
local.bibliographicCitation.startpage305
local.contributor.affiliationGrastien, Alban , College of Engineering and Computer Science, ANU
local.contributor.affiliationAnbulagan, Anbu, College of Engineering and Computer Science, ANU
local.contributor.affiliationRintanen, Jussi , College of Engineering and Computer Science, ANU
local.contributor.affiliationKelareva, Elena, University of Melbourne
local.contributor.authoruidGrastien, Alban , a230022
local.contributor.authoruidAnbulagan, Anbu, u4593416
local.contributor.authoruidRintanen, Jussi , u1814932
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080199 - Artificial Intelligence and Image Processing not elsewhere classified
local.identifier.ariespublicationu8803936xPUB140
local.identifier.scopusID2-s2.0-36349021952
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
02_Grastien_Diagnosis_of_discrete-event_2007.pdf
Size:
457.42 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS