Fault diagnosis of triangular grids

This paper introduces a diagnosis algorithm for triangular grids. The diagnosis provided by the algorithm is proved to be correct, but possibly incomplete, if the number of expected faults in the system is below a "syndrome-dependent bound" asserted by the algorithm itself. The diagnosis algorithm has time complexity of O(n) were n is the number of units in the system. A stronger "syndrome-independent bound" T, holding lor every possible syndrome, is also derived by worst-case analysis. The paper concludes with a simulation study aimed at evaluating the degree of diagnosis correctness and completeness provided by the algorithm.