Complexity of the diagnosability problem for a general model of diagnosable systems

A. Sengupta, Arunabha Sen, S. Bandyopadhyay

Research output: Contribution to journalArticle

Abstract

The complexity of the diagnosability problem for a self-diagnosable system is analysed in this paper. The most commonly studied model (Preparata et al. 1967) for a diagnosable system has been analysed in the literature and a polynomial time algorithm for testing its diagnosability is known. This paper analyses a more general model of the diagnosable system and finds the diagnosability problem to be NP-hard. In this model, each unit is tested by several tests and each test is carried out jointly by several other units of the system as opposed to each test being carried out by a single unit as modelled by Preparata et al. (1967).

Original languageEnglish (US)
Pages (from-to)1235-1243
Number of pages9
JournalInternational Journal of Systems Science
Volume19
Issue number7
DOIs
StatePublished - Jan 1 1988

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Complexity of the diagnosability problem for a general model of diagnosable systems'. Together they form a unique fingerprint.

  • Cite this