Operative Diagnosis Algorithms for Single-Fault in Graph-Based Systems
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 potential faulty components, P S, corresponding to a set of ringing alarms A R. 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.
Unable to display preview. Download preview PDF.
- 1.K. H. Abbott. Robust operative diagnosis as problem solving in a hypothesis space. Proc. Seventh Nat’1 Conf. Artificial Intelligence, St. Paul, Minn., 1988.Google Scholar
- 3.T. H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. McGraw-Hill Book Co., New York, 1990.Google Scholar
- 4.T. Bylander D. Allemang, M.C. Tanner and J. Josephson. Computational complexity of hypothesis assembly. Proc. Tenth Int’l Joint Conf. Artificial Intelligence, Milan, 1987.Google Scholar
- 5.D. Lamb D. Chester and P. Dhurjati. Rule-based computer alarm analysis in chemical process plants. Proc. Micon-delcn., 22, 1984.Google Scholar
- 6.E. O’Shima J. Shiozaki, H. Matsuyama and M. Ira. An improved algorithm for diagnosis of system failures in the chemical process. Comp. Chem. Eng., 9(3), 1985.Google Scholar
- 8.R. Reiter. A theory of diagnosis from first principles. Artif. IntelL, 32, 1987.Google Scholar
- 9.P. Ribenboim. The Little Book of Big Primes. Springer-VerlagGoogle Scholar
- 11.G. Karsai S. Padalkar and N. Miyasaka. Real-time fault diagnosis. IEEE Expert, 6 1991.Google Scholar