Complexity and Compilability of Diagnosis and Recovery of Graph-Based Systems

International Journal of Intelligent Systems

This article reports complexity results on diagnosis of systems modeled as graphs. In this model introduced by Rao and Viswanadham, each component is a node of a graph, and an edge indicates that faults propagate from one component to the other one. The basic problem of diagnosis is known to be polynomial and NP-complete in the cases of single faults and multiple faults, respectively. We extend the complexity analysis to the case of faulty alarms, and also consider the problem of limiting the propagation of faults. We show that none of the considered diagnosis problems can be simplified by preprocessing the graph.

 @article{libe-06,
 title = {Complexity and Compilability of Diagnosis and Recovery of Graph-Based
 Systems},
 year = {2005},
 author = {Liberatore, Paolo},
 journal = {International Journal of Intelligent Systems},
 pages = {1053-1076},
 number = {10},
 volume = {20},
 }