Skip to main content
SpringerLink
Log in

t/s-Diagnosable systems: A characterization and diagnosis algorithm

  • Distribution And Graphs
  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 411))

Included in the following conference series:

Abstract

A classical PMC multiprocessor system [1] composed of n units is said to be t/s-diagnosable

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Preparata, F.P., Metze, G., Chlen, R.T., "On the Connection Asslgnment Problem of Diagnosable Systems," IEEE Trans. Electr. Compt., vol EC-16, pp. 848–854, Dec 1967.

    Google Scholar 

  2. Hakimi, S.L., Amin, A., "Characterization of the Connection Assignment of Diagnosable Systems," IEEE Trans. Comp., vol C-23, pp 86–88, Jan 1974.

    Google Scholar 

  3. Sullivan, G.F., "A Polynomial Time Algorithm for Fault Diagnosability," In Proc. 25th Annu. Symp. Foundations Comp. Sc., pp. 148–156, Oct 1984.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Article  MathSciNet  Google Scholar 

  6. Friedman, A.D., "A New Measure of Digital System Diagnosis," In Dig. 1975 Int. Symp. Fault-Tolerant Comput., pp. 167–170, June 1975.

    Google Scholar 

  7. Kavianpour, A., Friedman, A.D., "Efficient Design of Easily Diagnosable Systems," In Proc. 3rd USA-Japan Comput. Conf., pp. 251–257, 1978.

    Google Scholar 

  8. Chwa, K.Y., Hakimi, S.L., "On Fault Identification in Diagnosable Systems," IEEE Trans. Comp., vol. C-30, pp. 414–422, June 1981.

    Google Scholar 

  9. Yang, C.L., Masson, G.M., Leonetti, R.A., "On Fault Identification and Isolation in t 1/t 2-Diagnosable Systems," IEEE Trans. Comp., vol C-35, pp. 639–643, July 1986.

    Google Scholar 

  10. Sullivan, G., "The Complexity of System-Level Fault Diagnosis and Diagnosability," Ph.D. Dissertation, Yale University, 1986.

    Google Scholar 

  11. Bondy, J.A., Murty, U.S.R., Graph Theory with Applications, New York: Elsevier North-Holland 1976.

    Google Scholar 

  12. Hopcroft, J.E., Karp, R.M., "A n 2.5 algorithm for maximum matching in bipartite graphs," SIAM J. Comput., vol. 2, Dec 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. E.E. Dept., Concordia University, Montreal

    A. Das & K. Thulasiraman

  2. E.E. Dept., McGill University, Montreal

    V. K. Agarwal

  3. Dept. of Math. and Comp. Sc., SUNY, Brockport, N.Y.

    K. B. Lakshmanan

Authors
  1. A. Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Thulasiraman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. K. Agarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. K. B. Lakshmanan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Nagl

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Das, A., Thulasiraman, K., Agarwal, V.K., Lakshmanan, K.B. (1990). t/s-Diagnosable systems: A characterization and diagnosis algorithm. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1989. Lecture Notes in Computer Science, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52292-1_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-52292-1_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52292-8

  • Online ISBN: 978-3-540-46950-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation