Fault-tolerant computing: theory and techniques; vol. 1
Fault-tolerant computing: theory and techniques; vol. 1
An Algorithm for Determining the Fault Diagnosability of a System
IEEE Transactions on Computers
On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems
IEEE Transactions on Computers
Improved Diagnosability Algorithms
IEEE Transactions on Computers
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Single-Fault Set Diagnosability in the PMC Model
IEEE Transactions on Computers
A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
On Asymmetric Invalidation with Partial Tests
IEEE Transactions on Computers
Sequentially t-Diagnosable Systems: A Characterization and Its applications
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Diagnosability of regular systems
Journal of Algorithms
(t, k)-Diagnosable System: A Generalization of the PMC Models
IEEE Transactions on Computers
Diagnosabilities of Regular Networks
IEEE Transactions on Parallel and Distributed Systems
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
On sequential diagnosis of multiprocessor systems
Discrete Applied Mathematics
Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
IEEE Transactions on Computers
On diagnosability of large multiprocessor networks
Discrete Applied Mathematics
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks
Single-link failure detection in all-optical networks using monitoring cycles and paths
IEEE/ACM Transactions on Networking (TON)
On sequential diagnosis of multiprocessor systems
Discrete Applied Mathematics
| Hi-index | 15.06 |
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.