
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
V. Raghavan, A.R. Tripathi, "Improved Diagnosability Algorithms," IEEE Transactions on Computers, vol. 40, no. 2, pp. 143153, February, 1991.  
BibTex  x  
@article{ 10.1109/12.73585, author = {V. Raghavan and A.R. Tripathi}, title = {Improved Diagnosability Algorithms}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {2}, issn = {00189340}, year = {1991}, pages = {143153}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.73585}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Improved Diagnosability Algorithms IS  2 SN  00189340 SP143 EP153 EPD  143153 A1  V. Raghavan, A1  A.R. Tripathi, PY  1991 KW  PMC model; BGM model; diagnosability algorithms; selfdiagnosing system; fault sets KW  consistency; complexity; computational complexity; fault tolerant computing. VL  40 JA  IEEE Transactions on Computers ER   
The concepts of the PMC and BGM selfdiagnosing system models of F. P. Preparata et al. (1967) and F. Barsi et al. (1976), respectively, including the notions of fault sets, consistency, and diagnosability number, are reviewed. Two onestep diagnosability algorithms are applied, one to the PMC model and the other to the BGM model. In both models, onestep diagnosability refers to a system's ability to determine all the faulty units from single collection of test results. Using the letters n, m, and tau to denote the number of units, the number of tests, and the diagnosability number, respectively, it is shown that in the BGM model the algorithm has a complexity of O(n tau /sup 2//log tau ), and, in the PMC model, the algorithm has a complexity of O(n tau /sup 2.5/).
[1] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Reading, MA: AddisonWesley, 1976.
[2] F. J. Allan, T. Kameda, and S. Toida, "An approach to the diagnosability analysis of a system,"IEEE Trans. Comput., pp. 10401042, Oct. 1975.
[3] F. Barsi, F. Grandoni, and P. Maestrini, "A theory of diagnosability of digital systems,"IEEE Trans. Comput., vol. C25, pp. 585593, June 1976.
[4] A. T. Dahbura, "Systemlevel diagnosis: A perspective for the third decade," inProc. Princeton Workshop on Algorithms, Architectures, and Technological Issues for Models of Concurrent Computation, 1987.
[5] S. Even and R. Endre Tarjan, "Network flow and testing graph connectivity,"SIAM J. Comput., vol. 4, pp. 507518, Dec. 1975.
[6] S. Even,Graph Algorithms. Rockville, MD: Computer Science Press, 1979.
[7] H. Fujiwara and K. Kinoshita, "On the computational complexity of system diagnosis,"IEEE Trans. Comput., vol. C27, pp. 881885, Oct. 1978.
[8] J. E. Hopcroft and R. M. Karp, "AnO(n5/2) algorithm for maximum matchings in bipartite graphs,"SIAM J. Comput., vol. 2, pp. 225231, Dec. 1973.
[9] S. Karunanithi and A.D. Friedman, "Analysis of digital systems using a new measure of system diagnosis,"IEEE Trans. Comput., vol. C28, pp. 121133, Feb. 1979.
[10] C. R. Kime, C. S. Holt, J.A. McPherson, and J.E. Smith, "Fault diagnosis of distributed systems,"Compsac, pp. 355364, 1980.
[11] J. Narasimhan and K. Nakajima, "An algorithm for determining the fault diagnosability of a system,"IEEE Trans. Comput., vol. C35, no. 11, pp. 10041008, Nov. 1986.
[12] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Electron. Comput., vol. EC16, pp. 848854, Dec. 1967.
[13] V. Raghavan and A. Tripathi, "Towards an improved diagnosability algorithm," University of Minnesota Tech. Rep. TR 8756, Dec. 1987.
[14] G. F. Sullivan, "A polynomial time algorithm for fault diagnosability," inProc. Foundations Comput. Sci., 1984, pp. 148156.
[15] G. F. Sullivan, "The complexity of systemlevel fault diagnosability," Ph.D. dissertation, Yale, Univ., Sept. 1986.
[16] R. Endre Tarjan,Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, 1983.