Alarm placement in systems with fault propagation

Theoretical Computer Science

Volumn 243, Issue 1-2, 2000, Pages 269-288

  Lakshmanan, K B ^a   Rosenkrantz, Daniel J ^b   Ravi, S S ^b  

^a STATE UNIVERSITY OF NEW YORK   (United States)

^b State University of New York   (United States)

Author keywords

Alarm placement; Approximation algorithms; Fault diagnosis; Minimum test collection; NP optimization problems

Indexed keywords

EID: 0005321696     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)90214-6     Document Type: Article

References (20)

1. A. Aho, M.R. Garey, J.D. Ullman, The transitive reduction of a directed graph, SIAM J. Comput. 1 (1972) 131-137.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and intractability of approximation problems, Proc. 33rd IEEE FOCS, 1992, pp. 14-23.
3. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
4. P. Crescenzi, V. Kann, A compendium of NP optimization problems, ftp.nada.kth.se, pub/documents/ Theory/Viggo-Kann/compendium.ps, 1995.
5. U. Feige, A threshold of ln n for approximating set cover, Proc. 28th Ann. ACM STOC, Philadelphia, PA, 1996, pp. 314-318.
6. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
7. F. Harary, R.Z. Norman, D. Cartwright, Structural Models: An Introduction to the Theory of Directed Graphs, Wiley, New York, 1965.
8. T. Ibaraki, T. Kameda, S. Toida, NP-Complete diagnosis problems on system graphs, Trans. IECE Japan E-62 (1979) 81-88.
9. V. Kann, On the approximability of NP-complete optimization problems, Ph.D. Thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, 1992.
10. M. Kokawa, S. Miyazaki, S. Shingai, Fault location using digraph and inverse direction search with applications, Automatica 19 (1983) 729-736.
11. M. Kokawa, S. Shingai, Failure propagating simulation and nonfailure paths search in network systems, Automatica 18 (1982) 335-342.
12. P.G. Kolaitis, M.N. Thakur, Approximation properties of NP minimization classes, Proc. 6th Ann. Conf. on Structures in Complexity Theory, 1991, pp. 353-366.
13. C. Lund, M. Yannakakis, On the hardness of approximating minimization problems, JACM 41 (1994) 960-981.
14. M. Malek, K.Y. Liu, Graph theory models in fault diagnosis and fault tolerance, Design Automation Fault-Tolerant Comput. 3 (1979) 155-169.
15. W. Mayeda, C.R. Ramamoorthy, Distinguishability criteria in oriented graphs and its application to computer diagnosis-I, IEEE Trans. Circuit Theory 16 (1969) 448-454.
16. F.P. Preparata, G. Metze, R.T. Chien, On the connection assignment problem of diagnosable systems, IEEE Trans. Comput. 16 (1967) 848-854.
17. N.S.V. Rao, Computational complexity issues in synthesis of simple distributed detection networks, IEEE Trans. Systems Man and Cybernet 21 (1991) 1071-1081.
18. N.S.V. Rao, Expected-value analysis of two single fault diagnosis algorithms, IEEE Trans. Comput. 42 (1993) 272-280.
19. N.S.V. Rao, Computational complexity issues in operative diagnosis of graph-based systems, IEEE Trans. Comput. 42 (1993) 447-457.
20. J. Shiozaki, H. Matsuyama, E. O'Shima, M. Ira, An improved algorithm for diagnosis of system failures in the chemical process, Comp. Chem. Eng. 9 (1985) 285-293.