On Fault Isolation and Identification in t1/t1-Diagnosable Systems
IEEE Transactions on Computers
A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
Sequential Fault Occurrence and Reconfiguration in System Level Diagnosis
IEEE Transactions on Computers
A Characterization of t/s-Diagnosability and Sequential t-Diagnosability in Designs
IEEE Transactions on Computers
Sequential Diagnosability is Co-NP Complete
IEEE Transactions on Computers
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Diagnosis of t/(t +1)-Diagnosable Systems
SIAM Journal on Computing
A linear time algorithm for sequential diagnosis in hypercubes
Journal of Parallel and Distributed Computing
Sequentially t-Diagnosable Systems: A Characterization and Its applications
IEEE Transactions on Computers - Special issue on fault-tolerant computing
On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems
IEEE Transactions on Computers
A Graph Partitioning Approach to Sequential Diagnosis
IEEE Transactions on Computers
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
A Framework for Identifying Compromised Nodes in Wireless Sensor Networks
ACM Transactions on Information and System Security (TISSEC)
Diagnosability of Two-Matching Composition Networks
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
RunTest: assuring integrity of dataflow processing in cloud computing infrastructures
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
A survey of comparison-based system-level diagnosis
ACM Computing Surveys (CSUR)
Fault diagnosis for hypercube-like networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
| Hi-index | 14.99 |
In this paper, we introduce a new model for diagnosable systems called (t,k)-diagnosable system which guarantees that at least k faulty units (processors) in a system are detected provided that the number of faulty units does not exceed t. This system includes classical one-step diagnosable systems and sequentially diagnosable systems. We prove a necessary and sufficient condition for (t,k)-diagnosable system, and discuss a lower bound for diagnosability. Finally, we deal with a relation between (t,k)-diagnosability and diagnosability of classical basic models.