• DocumentCode
    1152937
  • Title

    An Algorithm for Determining the Fault Diagnosability of a System

  • Author

    Narasimhan, Jagannathan ; Nakajima, Kazuo

  • Author_Institution
    Burroughs Corporation
  • Issue
    11
  • fYear
    1986
  • Firstpage
    1004
  • Lastpage
    1008
  • Abstract
    The fault diagnosability problem is the problem of computing the maximum number of faulty units which a system can tolerate without losing its capability of identifying all such faulty units. We study this problem for the model introduced by Barsi, Grandoni, and Maestrini [2]. We present a new characterization of the model, and develop an efficient diagnosability algorithm for a system in this model.
  • Keywords
    Connection assignment; diagnosable systems; fault diagnosis; self-diagnosis; system diagnosability; test links; Automatic testing; Computer networks; Computer science; Error correction codes; Fault diagnosis; Large-scale systems; Sequential analysis; System testing; Connection assignment; diagnosable systems; fault diagnosis; self-diagnosis; system diagnosability; test links;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1986.1676703
  • Filename
    1676703
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1152937