Algorithms for fault identification in a diagnosable multiprocessor system

In the letter, two algorithms for fault identification in diagnosable systems are presented. The order of time complexity for worst-case analysis is given: while the first algorithm executes in a sequential fashion in 0(n), where n is the number of units in the system, the second algorithm executes in 0(log2 n) in a binary tree arrangement. The algorithms are applicable to a diagnostic model with no invalidation.