Skip to main content

On the complexity of system-level diagnostic algorithms

  • Conference paper
  • First Online:
Computer Aided Systems Theory — EUROCAST '91 (EUROCAST 1991)

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

Included in the following conference series:

  • 117 Accesses

Abstract

Eight classes of problems in the field of system-level diagnosis methods are defined on the basis of required diagnostic resolution, type of invalidation and number of test steps. Using the bounds on system complexity, the duration of one-step and sequential diagnostic procedures is evaluated and compared under different assumptions. This comparison shows that despite the generally accepted opinion, the sequential diagnostics may be sometimes shorter than diagnostics performed in one step.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F.P.Preparata, G.Metze, and R.T.Chien. On the Connection Assignment Problem of Diagnosable Systems. IEEE Trans. Electronic Computers, EC-16:848–854, 1967.

    Google Scholar 

  2. S.L.Hakimi and A.T.Amin. Characterization of the connection assignment of diagnosable systems. IEEE Transactions on Computers, C-23:86–88, 1974.

    Google Scholar 

  3. J. E. Smith. Universal System Diagnosis Algorithms. IEEE Transactions on Computers, C-28:374–378, 1979.

    Google Scholar 

  4. G. G. L. Mayer. A fault diagnosis algorithm for asymmetric modular architectures. IEEE Transactions on Computers, C-30:81–83, 1981.

    Google Scholar 

  5. A. T. Dahbura and G. M. Masson. An O(n 2.5) fault identification algorithm for diagnosable systems. IEEE Transactions on Computers, C-33:486–492, 1984.

    Google Scholar 

  6. A. D. Friedman. A new measure of digital system diagnosis. In Proc. 1975 Symp. on Fault Tolerant Comp., pages 167–170. IEEE Comp. Soc. Publ., 1975.

    Google Scholar 

  7. F. Barsi, F. Grandoni, and P. Maestrini. A theory of diagnosability of digital systems. IEEE Transactions on Computers, C-25:585–593, 1976.

    Google Scholar 

  8. M. Malek. A comparison connection assignment for diagnosis of multiprocessor systems. In Proc. Seventh International Symp. on Computer Architecture, pages 31–36, 1980.

    Google Scholar 

  9. S. Mallela and G. M. Masson. Diagnosable systems for intermittent faults. IEEE Transactions on Computers, C-27:360–366, 1978.

    Google Scholar 

  10. N. H. Vaidya, D. K. Pradhan. System level diagnosis: combining detection and location. In Proc. Fault-Tolerant Computing Symposium (FTCS-21), pages 488–495, Montreal, Canada, 1991.

    Google Scholar 

  11. J. Hlavička. Design of self-diagnosable modular system. In Proc. Fault-Tolerant Computing Symposium (FTCS-11), pages 106–108, Portland, Maine, U.S.A., 1981.

    Google Scholar 

  12. S. Karunanithi, A. D. Friedman. Analysis of digital systems using a new measure of system diagnosis. IEEE Transactions on Computers, C-28:121–132, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Franz Pichler Roberto Moreno Díaz

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hlavička, J. (1992). On the complexity of system-level diagnostic algorithms. In: Pichler, F., Díaz, R.M. (eds) Computer Aided Systems Theory — EUROCAST '91. EUROCAST 1991. Lecture Notes in Computer Science, vol 585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021027

Download citation

  • DOI: https://doi.org/10.1007/BFb0021027

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55354-0

  • Online ISBN: 978-3-540-47034-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics