System-level diagnosis: analysis of two new models
The two major digraph models of system-level diagnosis have been thoroughly analyzed. In this paper, we present two variations of the classic digraph models and discuss their viabilities. Then, we present characterization theorems for t-diagnosability (i.e., describe characteristics and assumptions which enable us to determine the status of the units in a system given the test results and that the number of faulty units does not exceed t). We also present one-step and adaptive diagnosis algorithms. We show that one of our algorithms is optimal and describe cases in which diagnosis in our models requires fewer test results and less restrictive topologies.
- A Theory of Diagnosability of Digital Systems
- An adaptive algorithm for system level diagnosis
- Diagnosable Systems for Intermittent Faults
- Graph theory
- On Adaptive System Diagnosis
- On Fault Identification in Diagnosable Systems
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Schemes for fault-tolerant computing: A comparison of modularly redundant and t-diagnosable systems
- Characterizing diagnoses and systems
- Two diagnostic models of distributed digital systems
- The diagnosabilities of and diagnosis algorithms for regular networks under two three-valued models
- A Generalized Theory for System Level Diagnosis
- Syndrome-decoding algorithms for static-diagnosis models
- scientific article; zbMATH DE number 1515850 (Why is no real title available?)
- Analysis of diagnosing processes in the man-machine systems
This page was built for publication: System-level diagnosis: analysis of two new models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092012)