Operative diagnosis algorithms for single-fault in graph-based systems

Authors:
Mourad Elhadef;Béchir El Ayeb;Nageswara S. V. Rao
Affiliations:
-;-;-
Venue:
IEA/AIE '00 Proceedings of the 13th international conference on Industrial and engineering applications of artificial intelligence and expert systems: Intelligent problem solving: methodologies and approaches
Year:
2000

Citing 7
Cited 0

A theory of diagnosis from first principles

Artificial Intelligence
The little book of big primes

The little book of big primes
Introduction to Algorithms

Introduction to Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Computational Complexity Issues in Operative Diagnostics of Graph-Based Systems

IEEE Transactions on Computers
Real-Time Fault Diagnostics

IEEE Expert: Intelligent Systems and Their Applications
Computational complexity of hypothesis assembly

IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of real-life systems can be modeled, to a certain level of abstraction, as directed graphs for the purpose of fault diagnosis. In these graphs, system components are represented as nodes and the fault propagation between any two nodes is represented by an edge between them. Alarms are attached to some components to detect faults. The fault diagnosis problem deals with computing the set of all potentialfau lty components, PS, corresponding to a set of ringing alarms AR. Exactly one component can become a fault source at any time, and the fault can subsequently propagate to others. In this paper, we present two algorithms for the single fault diagnosis problem which perform better than existing algorithms under different conditions.