On parallel algorithms for single-fault diagnosis in fault propagation graph systems

Systems modeled as directed graphs where nodes represent components and edges represent fault propagation between components, are studied from a parallel computation viewpoint. Some of the components are equipped with alarms that ring in response to an abnormal condition. The single fault diagnosis problem is to compute the set of all potential failure sources, P_S, that correspond to a set of ringing alarms A_R. There is a lower bound for any sequential algorithm for this problem (under a decision tree model)