Abstract
In this paper we study the problem of diagnosing t/s-diagnosable systems. We present a t/t+k-diagnosis algorithm which runs in polynomial time for each fixed integer k. The t/t-diagnosis algorithm of [10], the t/t+1-diagnosis algorithm of [11] and the t/t+k-diagnosis algorithm of this paper complement the corresponding t/t+k-diagnosability algorithms of Sullivan [12]. It is shown in [17] that the basic approach of the t/t+k-diagnosis algorithm of this paper can be used to design a diagnosis algorithm for a sequentially t-diagnosable system which has complexity O(n 3.5 +mnt t) where m and n are the number of edges and vertices, respectively, of the test interconnection graph.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Preparata, F.P., Metze, G., Chien, R.T., "On the Connection Assignment Problem of Diagnosable Systems," IEEE Trans. Electr. Compt., vol EC-16, pp. 848–854, Dec 1967.
Hakimi, S.L., Amin, A., "Characterization of the Connection Assignment of Diagnosable Systems," IEEE Trans. Comp., vol. C-23, pp 86–88, Jan 1974.
Sullivan, G.F., "A Polynomial Time Algorithm for Fault Diagnosability," in Proc. 25th Annu. Symp. Foundations Comp. Sc., pp. 148–156, Oct 1984.
Dahbura, A.T., Masson, G.M., "A Practical Variation of the O(n 2.5) Fault Diagnosis Algorithm," in 14th Int. Symp. Fault-Tolerant Comput., 1984.
Sullivan, G.F., "An O(t 3 + |E|) Fault Identification Algorithm for Diagnosable Systems," IEEE Trans. Comp., vol C-37, pp. 388–397, April 1988.
Somani, A.K., Avis, D., Agarwal, V.K., "A generalized Theory for System-Level Diagnosis," IEEE Trans. Comp., vol. C-36, pp. 538–546, May 1987.
Friedman, A.D., "A New Measure of Digital System Diagnosis," in Dig. 1975 Int. Symp. Fault-Tolerant Comput., pp. 167–170, June 1975.
Kavianpour, A., Friedman, A.D., "Efficient Design of Easily Diagnosable Systems," in Proc. 3rd USA-Japan Comput. Conf., pp. 251–257, 1978.
Chwa, K.Y., Hakimi, S.L., "On Fault Identification in Diagnosable Systems," IEEE Trans. Comp., vol. C-30, pp. 414–422, June 1981.
Yang, C.L., Masson, G.M., Leonetti, R.A., "On Fault Identification and Isolation in t 1/t 1-Diagnosable Systems," IEEE Trans. Comp., vol C-35, pp. 639–643, July 1986.
Das A., Thulasiraman K., Agarwal V.K., Lakshmanan K.B., "t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm", 15th International Conf. on Graph-Theoretic Concepts in Computer Science, Rolduc, Holland (1989).
Sullivan, G., "The Complexity of System-Level Fault Diagnosis and Diagnosability," Ph.D. Dissertation, Yale University, 1986.
Raghavan, V., "Diagnosability Issues in Multiprocessor Systems," Ph.D. Dissertation, University of Minnesota, 1989.
Bondy, J.A., Murty, U.S.R., Graph Theory with Applications, New York: Elsevier North-Holland 1976.
Hopcroft, J.E., Karp, R.M., "A n 2.5 algorithm for maximum matching in bipartite graphs," SIAM J. Comput., vol. 2, Dec 1973.
Huang, S., Xu, J., Chen, T., "Characterization and Design of Sequentially t-Diagnosable Systems," in Dig. 19th Int. Symp. Fault-Tolerant Comput., pp. 554–559, June 1989.
Das, A., "Diagnosability and Diagnosis of Sparsely Interconnected Multiprocessor Systems," Ph.D. Dissertation, Concordia University, Montreal, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, A., Thulasiraman, K. (1991). Diagnosis of t/s-diagnosable systems. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, vol 484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53832-1_43
Download citation
DOI: https://doi.org/10.1007/3-540-53832-1_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53832-5
Online ISBN: 978-3-540-46310-8
eBook Packages: Springer Book Archive