
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
N.S.V. Rao, "ExpectedValue Analysis of Two Single Fault Diagnosis Algorithms," IEEE Transactions on Computers, vol. 42, no. 3, pp. 272280, March, 1993.  
BibTex  x  
@article{ 10.1109/12.210170, author = {N.S.V. Rao}, title = {ExpectedValue Analysis of Two Single Fault Diagnosis Algorithms}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {3}, issn = {00189340}, year = {1993}, pages = {272280}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.210170}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  ExpectedValue Analysis of Two Single Fault Diagnosis Algorithms IS  3 SN  00189340 SP272 EP280 EPD  272280 A1  N.S.V. Rao, PY  1993 KW  expected value analysis; single fault diagnosis algorithms; fault propagation properties; directed graphs; active alarms; worstcase time complexity; computational complexity; directed graphs; failure analysis; logic testing. VL  42 JA  IEEE Transactions on Computers ER   
The problem of diagnosing single faults is addressed for systems whose fault propagation properties can be modeled as directed graphs. In these systems, the nodes represent components and the edges represent fault propagation between the components. Some of the components are equipped with alarms that become active in response to faulty conditions. Two algorithms, FORWARD and BACKWARD, for computing the set of all potential candidates for a single fault that corresponds to a given set of active alarms, are studied. FORWARD moves forward from candidate nodes checking to see if they satisfy the alarm condition, and BACKWARD moves backwards from the alarms. In terms of worstcase time complexity, BACKWARD is better. These algorithms are analyzed using systems that are uniformly and randomly generated. In terms of the expected number of distinct nodes that are visited, FORWARD is shown to be better, and in terms of the total number of node visits, BACKWARD is found to be better. Thus, these algorithms are suited for different modes of storing the system graph.
[1] K. H. Abbott, "Robust operative diagnosis as problem solving in a hypothesis space," inProc. 7th Nat. Conf. Artif. Intell., St. Paul, MN, 1988.
[2] M. Abramowitz and I. A. Stegun, Ed.,Handbook of Mathematical Functions, Vol. I. New York: Dover, 1965, Formula No. 4.1.33, p. 68.
[3] D. Allemang, M. C. Tanner, T. Bylander, and J. Josephson, "Computational complexity of hypothesis assembly," inProc. 10th Int. Joint Conf. Artif. Intell., Milan, Italy, 1987, pp. 11121117.
[4] W. H. Beyer,Standard Mathematical Tables, 24th ed. Boca Raton, FL: CRC Press, 1974.
[5] T. Bylander, "Complexity of modelbased diagnosis," inProc. 1989 Workshop Model Based Reasoning, Detroit, MI, pp. 2833.
[6] D. Chester, D. Lamb, and P. Dhurjati, "Rulebased computer alarm analysis in chemical process plants,"Proc. Micondelcn., vol. 22, pp. 2229, 1984.
[7] T. Ibaraki, T. Kameda, and S. Toida, "NPcomplete diagnosis problems on system graphs,"Trans. IECE Japan, vol. E62, no. 2, pp. 8188, 1979.
[8] M. Ira, K. Aoki, E. O'Shima, and H. Matsuyama, "An algorithm for diagnosis of system failures in the chemical process,"Comp. Chem. Eng., vol. 3, pp. 489493, 1985.
[9] R. Isermann, "Process faultdetection based on modeling and estimation methodsA survey,"Automatica, vol. 20, no. 4, pp. 387404, 1984.
[10] Y. Ishida, N. Adachi, and H. Tokumaru, "A topological approach to failure diagnosis of largescale systems,"IEEE Trans. Syst., Man., Cybern., vol. SMC15, no. 3, pp. 327333, May/June 1985.
[11] M. Kokawa, S. Miyazaki, and S. Shingai, "Fault location using digraph and inverse direction search with applications,"Automatica, vol. 19, no. 6, pp. 729735, 1983.
[12] S. A. Lapp and G. J. Powers, "Computeraided synthesis of faulttrees,"IEEE Trans. Reliability, vol. R26, pp. 213, 1977.
[13] J. Lin, "FADTOOLGeneral purpose fault diagnosis tool," Master's Project Rep., Dep. Comput. Sci., Old Dominion Univ., 1990.
[14] S. Maheshwari and H. L. Hakimi, "On models for diagnosable systems and probabilistic diagnosis,"IEEE Trans. Comput., vol. C25, pp. 228236, 1976.
[15] W. Mayeda and C. V. Ramamoorthy, "Distinguishability criteria in oriented graphs and its application to computer diagnosisI,"IEEE Trans. Circuit Theory, vol. CT16, pp. 448454, 1969.
[16] H. Nakano and Y. Nakanishi, "Graph representation and diagnosis for multiunit faults,"IEEE Trans. Reliability, vol. R23, no. 5, pp. 320325, 1974.
[17] S. Padalkar, G. Karsai, C. Biegl, J. Sztipanovits, K. Okuda, and N. Miyasaka, "Realtime fault diagnostics,"IEEE Expert, pp. 7585, June 1991.
[18] J. Pearl,Heuristics. Reading, MA: AddisonWesley, 1984.
[19] N. S. V. Rao and N. Viswanadham, "Fault diagnosis in dynamical systems: A graph theoretic approach,"Int. J. Syst. Sci., vol. 18, no. 4, pp. 687695, 1987.
[20] N. S. V. Rao, "Computational complexity issues in operative diagnosis of graphbased systems," Tech. Rep. 9108, Dep. Comput. Sci., Old Dominion Univ.,IEEE Trans. Comput., to be published.
[21] J. Shiozaki, H. Matsuyama, E. O'Shima, and M. Ira, "An improved algorithm for diagnosis of system failures in the chemical process,"Comp. Chem. Eng., vol. 9, no. 3, pp. 285293, 1985.
[22] A. K. Somani, V. K. Agarwal, and D. Avis, "On the complexity of single fault set diagnosability and diagnosis problem,"IEEE Trans. Comput., vol. 38, no. 2, pp. 195201, 1989.
[23] S. Toida, "A graph model for fault diagnosis,"J. Digital Syst., vol. VI, no. 4, pp. 345365, 1982.
[24] N. H. Ulerich and G. J. Powers, "Online hazard aversion and fault diagnosis in chemical processes: The digraph + faulttree method,"IEEE Trans. Reliability, vol. 37, no. 2, pp. 171177, 1988.