The Community for Technology Leaders
Green Image
Issue No. 08 - August (1981 vol. 30)
ISSN: 0018-9340
pp: 590-596
J.T. Butler , Department of Electrical Engineering and Computer Science, Northwestern University
Expressions are derived for the average number of steps. required (speed) and the average number of fault-free units replaced (efficiency) when universal diagnosis algorithms are applied to systems of various degrees of interconnection (complexity). Specifically, two algorithms proposed by Smith [4] are considered. It is shown, for example, that there is a clear tradeoff between the two algorithms; one is much faster, while the other is more efficient.
test interconnections, Diagnosis algorithms, fault diagnosis, graph model of system diagnosis, multiple faults, system reliability

J. Butler, "Speed-Efficiency-Complexity Tradeoffs in Universal Diagnosis Algorithms," in IEEE Transactions on Computers, vol. 30, no. , pp. 590-596, 1981.
87 ms
(Ver 3.3 (11022016))