Speed-Efficiency-Complexity Tradeoffs in Universal Diagnosis Algorithms

1 August 1981

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-30 (8) , 590-596
https://doi.org/10.1109/tc.1981.1675845

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.

Keywords

This publication has 7 references indexed in Scilit:

Universal System Diagnosis Algorithms
IEEE Transactions on Computers, 1979
Analysis of Digital Systems Using a New Measure of System Diagnosis
IEEE Transactions on Computers, 1979
Some Existence Theorems for Probabilistically Diagnosable Systems
IEEE Transactions on Computers, 1978
A Theory of Diagnosability of Digital Systems
IEEE Transactions on Computers, 1976
On Models for Diagnosable Systems and Probabilistic Fault Diagnosis
IEEE Transactions on Computers, 1976
System Fault Diagnosis: Closure and Diagnosability with Repair
IEEE Transactions on Computers, 1975
On the Connection Assignment Problem of Diagnosable Systems
IEEE Transactions on Electronic Computers, 1967