Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
Diagnosable Systems for Intermittent Faults
IEEE Transactions on Computers
Diagnosis Without Repair for Hybrid Fault Situations
IEEE Transactions on Computers
A Polynomial Time Algorithm For Fault Diagnosability
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
A Comparison-Based Approach to Multicomputer System Diagnosis in Hybrid Fault Situations
IEEE Transactions on Computers
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Formally Verified On-Line Diagnosis
IEEE Transactions on Software Engineering
Number of mutual connections in neighborhoods and its application to self-diagnosable systems
Information Processing Letters
| Hi-index | 14.98 |
Using the PMC model of a multiprocessor system, a new, general quality of hybrid fitult (combinations of hard anid soft failing units) diagnosability is characterized which encompasses previously known results as well as provides a major extension. This new diagnosability, called t/ts/t-diagnosability, serves as a measure of the extent to which collections of test results, called syndromes, contain information relative to faulty unit identification for various testing assignments. By analyzing a system's test assignment over tahges of the parameter values t, ts, and t, the spectrum of diagnosis quality achievable in that system can be established. Fundamental interrelationships among these parameters are developed. Optimal designs of t/ts/t-diagnosable systems are presented. The main result of this correspondence can be viewed as a master fault diagnosability characterization which from the perspective of usefulness of the syndrome space for correct diagnosis both unifies and expands the domain of hybrid fault diagnosabilities.