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 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 previously as modelled.

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

Fingerprint

Diagnosability
Unit
Polynomials
Model
Polynomial-time Algorithm
NP-complete problem
Testing

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Management Science and Operations Research
  • Control and Systems Engineering
  • Theoretical Computer Science

Cite this

COMPLEXITY OF THE DIAGNOSABILITY PROBLEM FOR A GENERAL MODEL OF DIAGNOSABLE SYSTEMS. / Sengupta, A.; Sen, Arunabha; Bandyopadhyay, S.

In: International Journal of Systems Science, Vol. 19, No. 7, 07.1988, p. 1235-1243.

Research output: Contribution to journalArticle

@article{8956594dea494205acc24caa4df3ffd3,
title = "COMPLEXITY OF THE DIAGNOSABILITY PROBLEM FOR A GENERAL MODEL OF DIAGNOSABLE SYSTEMS.",
abstract = "The complexity of the diagnosability problem for a self-diagnosable system is analysed in this paper. The most commonly studied model 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 previously as modelled.",
author = "A. Sengupta and Arunabha Sen and S. Bandyopadhyay",
year = "1988",
month = "7",
language = "English (US)",
volume = "19",
pages = "1235--1243",
journal = "International Journal of Systems Science",
issn = "0020-7721",
publisher = "Taylor and Francis Ltd.",
number = "7",

}

TY - JOUR

T1 - COMPLEXITY OF THE DIAGNOSABILITY PROBLEM FOR A GENERAL MODEL OF DIAGNOSABLE SYSTEMS.

AU - Sengupta, A.

AU - Sen, Arunabha

AU - Bandyopadhyay, S.

PY - 1988/7

Y1 - 1988/7

N2 - The complexity of the diagnosability problem for a self-diagnosable system is analysed in this paper. The most commonly studied model 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 previously as modelled.

AB - The complexity of the diagnosability problem for a self-diagnosable system is analysed in this paper. The most commonly studied model 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 previously as modelled.

UR - http://www.scopus.com/inward/record.url?scp=0024051434&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024051434&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0024051434

VL - 19

SP - 1235

EP - 1243

JO - International Journal of Systems Science

JF - International Journal of Systems Science

SN - 0020-7721

IS - 7

ER -