• DocumentCode
    746422
  • Title

    (t, k)-diagnosable system: a generalization of the PMC models

  • Author

    Araki, Toru ; Shibata, Yukio

  • Author_Institution
    Satellite Venture Bus. Lab., Gunma Univ., Japan
  • Volume
    52
  • Issue
    7
  • fYear
    2003
  • fDate
    7/1/2003 12:00:00 AM
  • Firstpage
    971
  • Lastpage
    975
  • Abstract
    We introduce a new model for diagnosable systems called (t, k)-diagnosable system which guarantees that at least k faulty units (processors) in a system are detected provided that the number of faulty units does not exceed t. This system includes classical one-step diagnosable systems and sequentially diagnosable systems. We prove a necessary and sufficient condition for (t, k)-diagnosable system, and discuss a lower bound for diagnosability. Finally, we deal with a relation between (t, k)-diagnosability and diagnosability of classical basic models.
  • Keywords
    fault diagnosis; fault tolerant computing; multiprocessing systems; Cartesian product; PMC models; classical basic model diagnosability; fault diagnosis; faulty units; lower bound; multiprocessor system; one-step diagnosable systems; sequentially diagnosable systems; Computer Society; Fault detection; Fault diagnosis; Fault tolerant systems; Multiprocessing systems; Sequential diagnosis; Sufficient conditions; System testing;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2003.1214345
  • Filename
    1214345