Rintanen, JussiGrastien, AlbanVeloso, M. M.2015-12-08January 6-http://hdl.handle.net/1885/29605We 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 kKeywords: AI planning; Diagnosability; Failure behaviors; Finding paths; Satisfiability algorithms; Satisfiability problems; System behaviors; Transition graphs; Algorithms; Artificial intelligence; Formal logic20072022-08-07