This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computational Complexity Issues in Operative Diagnostics of Graph-Based Systems
April 1993 (vol. 42 no. 4)
pp. 447-457

[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] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[3] D. Allemang, M. C. Tanner, T. Bylander, and J. Josephson, "Computational complexity of hypothesis assembly," inProc. 10th Int. Joint Conf. Artif. Intell., Milan, 1987, pp. 1112-1117.
[4] T. Bylander, "Complexity of model-based diagnosis," inProc. 1989 Workshop Model Based Reasoning, Detroit, MI, pp. 28-33.
[5] D. Chester, D. Lamb, and P. Dhurjati, "Rule-based computer alarm analysis in chemical process plants,"Proc. Micon-delcn., vol. 22, pp. 22-29, 1984.
[6] R. Davis, "Diagnostic reasoning based on structure and behavior,"Artificial Intell., vol. 24, pp. 347-410, Dec. 1984.
[7] J. de Kleer and B.C. Williams, "Diagnosing multiple faults,"Artif. Intell., vol. 32, pp. 97-130, 1981.
[8] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[9] M. R. Genesereth, "The use of design descriptions in automated diagnosis,"Artificial Intell., vol. 24, pp. 411-436, Dec. 1984.
[10] R. Greiner, B. A. Smith, and R. W. Wilkerson, "A correction to the algorithm in Reiter's theory of diagnosis,"Artif. Intell., vol. 24, pp. 79-88, 1989/90.
[11] T. Ibaraki, T. Kameda, and S. Toida, "NP-complete diagnosis problems on system graphs,"Trans. IECE Japan, vol. E62, no. 2, pp. 81-88, 1979.
[12] 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. 489-493, 1985.
[13] R. Isermann, "Process fault-detection based on modeling and estimation methods - A survey,"Automatica, vol. 20, no. 4, pp. 387-404, 1984.
[14] Y. Ishida, N. Adachi, and H. Tokumaru, "A topological approach to failure diagnosis of large-scale systems,"IEEE Trans. Syst., Man, Cybern., vol. SMC-15, no. 3, pp. 327-333, May/June 1985.
[15] D. S. Johnson, "Approximation algorithms for combinatorial problems,"J. Comput. Syst. Sci., vol. 9, pp. 256-278, 1974.
[16] M. Kokawa and S. Shingai, "Failure propagating simulation and nonfailure paths search in network systems,"Automatica, vol. 18, no. 3, pp. 335-341, 1982.
[17] M. Kokawa, S. Miyazaki, and S. Shingai, "Fault location using digraph and inverse direction search with applications,"Automatica, vol. 19, no. 6, pp. 729-735, 1983.
[18] S. A. Lapp and G.J. Powers, "Computer-aided synthesis of fault-trees,"IEEE Trans. Reliability, vol. R-26, pp. 2-13, 1977.
[19] S. Maheshwari and H.L. Hakimi, "On models for diagnosable systems and probabilistic diagnosis,"IEEE Trans. Comput., vol. C-25, pp. 228-236, 1976.
[20] W. Mayeda and C. V. Ramamoorthy, "Distinguishability criteria in oriented graphs and its application to computer diagnosis--I,"IEEE Trans. Circuit Theory, vol. CT-16, pp. 448-454, 1969.
[21] H. Nakano and Y. Nakanishi, "Graph representation and diagnosis for multiunit faults,"IEEE Trans. Reliability, vol. R-23, no. 5, pp. 320-325, 1974.
[22] J. Pearl, "Fusion, propagation, and structuring in belief networks,"Artif. Intell., vol. 33, pp. 173-215, 1987.
[23] Y. Peng and J. A. Reggia, "Plausibility of diagnostic hypothesis: The nature of simplicity," inProc. 5th Nat. Conf. Artif. Intell.(AAAI-86), 1986, pp. 140-145.
[24] F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: Springer-Verlag, 1985.
[25] 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. 687-695, 1987.
[26] N. S. V. Rao, "On parallel algorithms for single fault diagnosis," inProc. 1990 Int. Conf. Parallel Processing, pp. 259-266.
[27] N. S. V. Rao, "Expected-value analysis of two single fault diagnosis algorithms,"IEEE Trans. Comput., vol. 42, no. 3, pp. 272-280, 1993.
[28] J. A. Reggia, D. S. Nau, and P. Y. Wang, "Diagnostic expert systems based on-a set covering model,"Int. J. Man-Maihine Studies, vol. 19, pp. 437-460, 1983.
[29] J. A. Reggia, D. S. Nau, P. Y. Wang, and Y. Peng, "A formal model of diagnosis inference, I. Problem formulation and decomposition,"Inform. Sci., vol. 37, pp. 227-256, 1985.
[30] J. A. Reggia, D. S. Nau, P. Y. Wang, and Y. Peng, "A formal model of diagnosis inference, I. Algorithmic solution and application."
[31] R. Reiter, "A theory of diagnosis from first principles,"Artif. Intell., vol. 32, pp. 57-95, 1987.
[32] 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. 285-293, 1985.
[33] 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. 195-201, 1989.
[34] R. E. Tarjan, "Depth-first search and linear graph algorithms,"SIAM J. Comput., vol. 1, no. 2, pp. 146-160, 1972.
[35] S. Toida, "A graph model for fault diagnosis,"J. Digital Syst., vol. VI, no. 4, pp. 345-365, 1982.
[36] N. H. Ulerich and G. J. Powers, "On-line hazard aversion and fault diagnosis in chemical processes: The digraph + fault-tree method,"IEEE Trans. Reliability, vol. 37, no. 2, pp. 171-177, 1988.

Index Terms:
computational complexity; fault diagnosis; graph-based systems; fault propagation; alarm placement; fault propagation time; NP-complete; alarm placement problem; computational complexity; fault tolerant computing.
Citation:
N.S.V. Rao, "Computational Complexity Issues in Operative Diagnostics of Graph-Based Systems," IEEE Transactions on Computers, vol. 42, no. 4, pp. 447-457, April 1993, doi:10.1109/12.214691
Usage of this product signifies your acceptance of the Terms of Use.