This Article 
 Bibliographic References 
 Add to: 
A O(t³+ |E| ) Fault Identification Algorithm for Diagnosable Systems
April 1988 (vol. 37 no. 4)
pp. 388-397
Systems composed of many processing units can use these units to help perform self-diagnosis. An algorithm is presented that performs this type of diagnosis for the system-level fault model. The time complexity of the algorithm is O(t³+ |E|), where |E| is the number of tests and t is the number of allowed faults. When t is small relative to the total number of system components n, this is

[1] F. J. Allan, T. Kameda, and S. Toida, "An approach to the diagnosability analysis of a system,"IEEE Trans. Comput., vol. C- 24, pp. 1040-1042, 1975.
[2] 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.
[3] K. V. S. Bhat, "Algorithms for finding diagnosability level andt- diagnosis in a network of processors," inProc. 1982 Nat. ACM Conf., ACM, 1982.
[4] K.-Y. Chwa and S. L. Hakimi, "Schemes for fault-tolerant computing: A comparison of modularity redundant andt-diagnosable systems,"Inform. Contr., vol. 49, pp. 212-238, 1981.
[5] A. M. Corluhan and S. L. Hakimi, "On an algorithm for identifying faults in at-diagnosable system," inProc. 1976 Conf. Inf. Sci. Syst., Johns Hopkins Univ., Apr. 1976, pp. 370-375.
[6] A. T. Dahbura, "An efficient algorithm for identifying the most likely fault set in a probabilistically diagnosable system,"IEEE Trans. Comput., vol. C-35, pp. 354-356, Apr. 1986.
[7] A. T. Dahbura and G. M. Masson, "AnO(n2.5) fault identification algorithm for diagnosable systems,"IEEE Trans. Comput., June 1984.
[8] A. T. Dahbura and G. M. Masson, "A practical variation of theO(n2.5) fault diagnosis algorithm," inProc. 14th Int. Symp. Fault-Tolerant Comput., IEEE, 1984.
[9] A. T. Dahbura, G. M. Masson, and C.-L. Yang, "Self-implicating structures for diagnosable systems,"IEEE Trans. Comput., vol. C-34, pp. 718-723, Aug. 1985.
[10] A. D. Friedman and L. Simoncini, "System-level fault diagnosis,"Computer, vol. 13, pp. 47-53, Mar. 1980.
[11] S. L. Hakimi and A. T. Amin, "Characterization of connection assignment of diagnosable systems,"IEEE Trans. Comput., vol. C- 23, pp. 86-88, 1974.
[12] T. Kameda, S. Toida, and F. J. Allan, "A diagnosing algorithm for networks,"Inform. Contr., vol. 29, pp. 141-148, 1975.
[13] S. Karunanithi and A. D. Friedman, "An analysis of digital systems using a new measure of system diagnosis,"IEEE Trans. Comput., vol. C-25, pp. 121-133, Feb. 1979.
[14] S. N. Maheshwari and S. L. Hakimi, "On models for diagnosable systems and probabilistic fault diagnosis,"IEEE Trans. Comput., vol. C-25, pp. 228-236, 1976.
[15] 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, 1967.
[16] G. F. Sullivan, "The complexity of system-level fault diagnosability," Ph.D. dissertation, Yale, Univ., Sept. 1986.
[17] G. F. Sullivan, "AnO(t3+ E
[18] G. F. Sullivan, "A polynomial time algorithm for fault diagnosability," inProc. Foundations Comput. Sci., 1984, pp. 148-156.

Index Terms:
fault identification algorithm; diagnosable systems; time complexity; fault tolerant computing.
G.F. Sullivan, "A O(t³+ |E| ) Fault Identification Algorithm for Diagnosable Systems," IEEE Transactions on Computers, vol. 37, no. 4, pp. 388-397, April 1988, doi:10.1109/12.2182
Usage of this product signifies your acceptance of the Terms of Use.