Skip navigation
Skip navigation

Diagnosability testing with satisfiability algorithms

Rintanen, Jussi; Grastien, Alban


We show how testing whether a system is diagnosable can be reduced to the satisfiability problem and how satisfiability algorithms yield a very efficient approach to testing diagnosability. Diagnosability is the question whether it is always possible to k

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
Source: Proceedings of the International Joint Conference on Artificial Intelligence


File Description SizeFormat Image
01_Rintanen_Diagnosability_testing_with_2007.pdf25.91 kBAdobe PDF    Request a copy
02_Rintanen_Diagnosability_testing_with_2007.pdf43.92 kBAdobe PDF    Request a copy
03_Rintanen_Diagnosability_testing_with_2007.pdf308.01 kBAdobe PDF    Request a copy
04_Rintanen_Diagnosability_testing_with_2007.pdf233.08 kBAdobe PDF    Request a copy

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator