This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Weighted Diagnosis with Asymmetric Invalidation
December 1996 (vol. 45 no. 12)
pp. 1435-1438
ASCII Text
x 
 
Vijay Raghavan, "Weighted Diagnosis with Asymmetric Invalidation," IEEE Transactions on Computers, vol. 45, no. 12, pp. 1435-1438, December, 1996.
 
 
BibTex
x
 
@article{ 10.1109/12.545973,
author = {Vijay Raghavan},
title = {Weighted Diagnosis with Asymmetric Invalidation},
journal ={IEEE Transactions on Computers},
volume = {45},
number = {12},
issn = {0018-9340},
year = {1996},
pages = {1435-1438},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.545973},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Weighted Diagnosis with Asymmetric Invalidation
IS - 12
SN - 0018-9340
SP1435
EP1438
EPD - 1435-1438
A1 - Vijay Raghavan,
PY - 1996
KW - Asymmetric invalidation
KW - weighted diagnosability
KW - diagnosis
KW - PMC model
KW - BGM model.
VL - 45
JA - IEEE Transactions on Computers
ER -
 

Abstract—Prior research has extended the classical PMC (or Symmetric Invalidation) Model to incorporate a priori weights or probabilities associated with units. We consider a similar extension to the BGM (or Asymmetric Invalidation) Model. In contrast to the PMC model, where deciding the weighted diagnosability number is co-NP complete, we show that the diagnosability number in the weighted BGM model can be obtained in O(m2) time, where m is the number of tests in the system. We also show that diagnosis in this weighted model can be performed in O(T(n)) time, where n is the number of units in the system and $T(n) \approx n^{2.376}$ is the amount of time needed to multiply two n by n matrices.

[1] M.A. Barborak, M. Malek, and A.T. Dahbura, "The Consensus Problem in Fault-Tolerant Computing," ACM Computer Surveys, vol. 25, pp. 171-220, June 1993.
[2] F. Barsi, F. Grandoni, and P. Maestrini, "A Theory of Diagnosability of Digital Systems," IEEE Trans. Computers, vol. 25, no. 6, pp. 585-593, June 1976.
[3] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[4] D. Coppersmith and S. Winograd, "Matrix Multiplication via Arithmetic Progression," J. Symb. Computers, vol. 9, no. 3, pp. 1-6, Mar. 1990.
[5] A.T. Dahbura, "An Efficient Algorithm for Identifying the Most Likely Fault Set in a Probabilistically Diagnosable System," IEEE Trans. Computers, vol. 35, pp. 354-356, 1986.
[6] C.R. Kime, C.S. Holt, J.A. McPherson, and J.E. Smith, "Fault Diagnosis of Distributed Systems," Proc. Compsac, pp. 355-364, 1980.
[7] S.N. Maheshwari and S.L. Hakimi, "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis," IEEE Trans. Computers, vol. 25, pp. 228-236, Mar. 1976.
[8] G.G.L. Meyer, "A Diagnosis Algorithm for the BGM System-Level Fault Model," IEEE Trans. Computers, vol. 33, no. 8, pp. 756-758, Aug. 1976.
[9] F.P. Preparata, G. Metze, and R.T. Chien, "On the Connection Assignment Problem of Diagnosable Systems," IEEE Trans. Electronic Computers, vol. 16, no. 12, pp. 848-854, Dec. 1967.
[10] V. Raghavan and A. Tripathi, "Improved Diagnosability Algorithms," IEEE Trans. Computers, vol. 39, no. 2, pp. 143-153, Feb. 1991.
[11] A.K. Somani and V.K. Agarwal, "Diagnosis in Hybrid Fault Situations Under AIM and a Unified t-Characterization Theorem," Computer Math. Applications, vol. 13, pp. 567-576, May-June 1987.
[12] G.F. Sullivan, "A Polynomial Time Algorithm for Fault Diagnosability," Proc. 25th Symp. Foundations of Computer Science, pp. 148-156, Oct. 1984.

Index Terms:
Asymmetric invalidation, weighted diagnosability, diagnosis, PMC model, BGM model.
Citation:
Vijay Raghavan, "Weighted Diagnosis with Asymmetric Invalidation," IEEE Transactions on Computers, vol. 45, no. 12, pp. 1435-1438, Dec. 1996, doi:10.1109/12.545973
Usage of this product signifies your acceptance of the Terms of Use.