• DocumentCode
    1407763
  • Title

    Sequential diagnosability is co-NP complete

  • Author

    Raghavan, Vijay ; Tripathi, Anand

  • Author_Institution
    Dept. of Comput. Sci., Vanderbilt Univ., Nashville, TN, USA
  • Volume
    40
  • Issue
    5
  • fYear
    1991
  • fDate
    5/1/1991 12:00:00 AM
  • Firstpage
    584
  • Lastpage
    595
  • Abstract
    F.P. Preparata et al. (1967) introduced a graph-theoretical model for fault diagnosis called the PMC model. The question of determining the sequential diagnosability number of a system in the PMC model has remained open. The authors formalize the notion of sequential diagnosability. The question of determining the sequential diagnosability number of a system is addressed by showing that the appropriate decision problem is co-NP complete. The problem is also shown to be co-NP complete even when restricted to planar graphs both in the weighted and the BGM models
  • Keywords
    computational complexity; fault tolerant computing; graph theory; software reliability; BGM models; PMC model; co-NP complete; decision problem; fault diagnosis; graph theory model; planar graphs; sequential diagnosability number; weighted model; Automatic testing; Computer science; Fault diagnosis; Performance evaluation; Polynomials; Sequential analysis; Sequential diagnosis; System testing;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.88482
  • Filename
    88482