This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improved Diagnosability Algorithms
February 1991 (vol. 40 no. 2)
pp. 143-153

The concepts of the PMC and BGM self-diagnosing 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 one-step diagnosability algorithms are applied, one to the PMC model and the other to the BGM model. In both models, one-step 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: Addison-Wesley, 1976.
[2] F. J. Allan, T. Kameda, and S. Toida, "An approach to the diagnosability analysis of a system,"IEEE Trans. Comput., pp. 1040-1042, Oct. 1975.
[3] F. Barsi, F. Grandoni, and P. Maestrini, "A theory of diagnosability of digital systems,"IEEE Trans. Comput., vol. C-25, pp. 585-593, June 1976.
[4] A. T. Dahbura, "System-level 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. 507-518, 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. C-27, pp. 881-885, 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. 225-231, Dec. 1973.
[9] S. Karunanithi and A.D. Friedman, "Analysis of digital systems using a new measure of system diagnosis,"IEEE Trans. Comput., vol. C-28, pp. 121-133, Feb. 1979.
[10] C. R. Kime, C. S. Holt, J.A. McPherson, and J.E. Smith, "Fault diagnosis of distributed systems,"Compsac, pp. 355-364, 1980.
[11] J. Narasimhan and K. Nakajima, "An algorithm for determining the fault diagnosability of a system,"IEEE Trans. Comput., vol. C-35, no. 11, pp. 1004-1008, 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. EC-16, pp. 848-854, Dec. 1967.
[13] V. Raghavan and A. Tripathi, "Towards an improved diagnosability algorithm," University of Minnesota Tech. Rep. TR 87-56, Dec. 1987.
[14] G. F. Sullivan, "A polynomial time algorithm for fault diagnosability," inProc. Foundations Comput. Sci., 1984, pp. 148-156.
[15] G. F. Sullivan, "The complexity of system-level 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.

Index Terms:
PMC model; BGM model; diagnosability algorithms; self-diagnosing system; fault sets, consistency; complexity; computational complexity; fault tolerant computing.
Citation:
V. Raghavan, A.R. Tripathi, "Improved Diagnosability Algorithms," IEEE Transactions on Computers, vol. 40, no. 2, pp. 143-153, Feb. 1991, doi:10.1109/12.73585
Usage of this product signifies your acceptance of the Terms of Use.