The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1981 vol.30)
pp: 590-596
J.T. Butler , Department of Electrical Engineering and Computer Science, Northwestern University
ABSTRACT
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.
INDEX TERMS
test interconnections, Diagnosis algorithms, fault diagnosis, graph model of system diagnosis, multiple faults, system reliability
CITATION
J.T. Butler, "Speed-Efficiency-Complexity Tradeoffs in Universal Diagnosis Algorithms", IEEE Transactions on Computers, vol.30, no. 8, pp. 590-596, August 1981, doi:10.1109/TC.1981.1675845
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool