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

DOI10.1080/00207728808547159zbMath0653.90029OpenAlexW1999966028MaRDI QIDQ3799800

No author found.

Publication date: 1988

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728808547159

zbMATH Keywords

polynomial time algorithmNP-hardself-diagnosable systemcomplexity of the diagnosability problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Unnamed Item
• Unnamed Item
• On System Diagnosability in the Presence of Hybrid Faults
• Diagnosis Without Repair for Hybrid Fault Situations
• Diagnosis of Systems with Asymmetric Invalidation
• An Approach to the Diagnosability Analysis of a System
• A Theory of Diagnosability of Digital Systems
• On Models for Diagnosable Systems and Probabilistic Fault Diagnosis
• Analysis of Digital Systems Using a New Measure of System Diagnosis
• Characterization of Connection Assignment of Diagnosable Systems

This page was built for publication: Complexity of the diagnosability problem for a general model of diagnosable systems