TY - JOUR
T1 - Improved Diagnosability Algorithms
AU - Raghavan, Vijay
AU - Tripathi, Anand R.
PY - 1991/2
Y1 - 1991/2
N2 - We present improved one-step diagnosability algorithms for both the BGM and PMC models. Using the letters n, m, and r to denote the number of units, the number of tests, and the diagnosability number, respectively, the results of the paper can be summarized as follows: in the BGM model, our algorithm has a complexity of [formula Omitted] improving on Narasimhan and Nakajima’s O (nr3)algorithm; in the PMC model, our algorithm has a complexity of O(nr2.5) improving on Sullivan’s O(mn1.5) algorithm. Further, the ideas used in our algorithm for the PMC model can be easily extended to improve Sullivan’s algorithms for determining the t/t + k diagnosability numbers.
AB - We present improved one-step diagnosability algorithms for both the BGM and PMC models. Using the letters n, m, and r to denote the number of units, the number of tests, and the diagnosability number, respectively, the results of the paper can be summarized as follows: in the BGM model, our algorithm has a complexity of [formula Omitted] improving on Narasimhan and Nakajima’s O (nr3)algorithm; in the PMC model, our algorithm has a complexity of O(nr2.5) improving on Sullivan’s O(mn1.5) algorithm. Further, the ideas used in our algorithm for the PMC model can be easily extended to improve Sullivan’s algorithms for determining the t/t + k diagnosability numbers.
UR - http://www.scopus.com/inward/record.url?scp=0026108312&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026108312&partnerID=8YFLogxK
U2 - 10.1109/12.73585
DO - 10.1109/12.73585
M3 - Article
AN - SCOPUS:0026108312
SN - 0018-9340
VL - 40
SP - 143
EP - 153
JO - IEEE Transactions on Computers
JF - IEEE Transactions on Computers
IS - 2
ER -