Diagnosability testing with satisfiability algorithms

摘要: We show how testing whether a system is diagnosable can be reduced to the satisfiability problem and algorithms yield very efficient approach diagnosability. Diagnosability question it always possible know given has exhibited failure behavior. This basic that underlies diagnosis, also closely related more general questions about possibility facts behavior. The work combines twin plant construct of Jiang et al., which basis diagnosability systems with an enumerative representation, SAT-based techniques AI planning form promising finding paths in large transition graphs.