2002 · 21 citations · 12 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsDiagnostic ReasoningFault-tolerant ComputingDiagnosisDiagnosticsFault DetectionFault DiagnosisFault ModelingFinite-state MachinesDiagnostic ModelsSystem Fault DiagnosisTest Cases
The authors propose a generalized diagnostic algorithm for the case where more than one fault (output and/or transfer) may be present in the transitions of a system represented by a deterministic finite state machine (FSM). If existing faults are detected, this algorithm permits the generation of a minimal set of diagnoses, each of which is formed by a set of transitions (with specific types of faults) suspected of being faulty. The occurrence in an implementation of all the faults of a given diagnosis allows the explanation of all observed implementation outputs. The algorithm guarantees the correct diagnosis of certain configurations of faults (output and/or transfer) in an implementation, which are characterized by a certain type of independence of the different faults. The authors also propose an approach for selecting additional test cases, which allows the reduction of the number of possible diagnoses. A simple example is used to demonstrate the different steps of the algorithm.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
12
A theory of diagnosis from first principles
Raymond Reiter · Artificial Intelligence · 1987 · 2.9K citations
Johan de Kleer, Brian C. Williams · Artificial Intelligence · 1987 · 2.1K citations
Test selection based on finite state models
Susumu Fujiwara, Gregor von Bochmann, Ferhat Khendek et al. · IEEE Transactions on Software Engineering · 1991 · 564 citations
A protocol test generation procedure
Krishan Sabnani, Anton Dahbura · Computer Networks and ISDN Systems · 1988 · 416 citations