Computational complexity issues in operative diagnosis of graph-based systems
- 1 April 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 42 (4), 447-457
- https://doi.org/10.1109/12.214691
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- A correction to the algorithm in reiter's theory of diagnosisArtificial Intelligence, 1989
- On the complexity of single fault set diagnosability and diagnosis problemsIEEE Transactions on Computers, 1989
- On-line hazard aversion and fault diagnosis in chemical processes: the digraph+fault-tree methodIEEE Transactions on Reliability, 1988
- A theory of diagnosis from first principlesArtificial Intelligence, 1987
- An improved algorithm for diagnosis of system failures in the chemical processComputers & Chemical Engineering, 1985
- A topological approach to failure diagnosis of large-scale systemsIEEE Transactions on Systems, Man, and Cybernetics, 1985
- Process fault detection based on modeling and estimation methods—A surveyAutomatica, 1984
- An algorithm for diagnosis of system failures in the chemical processComputers & Chemical Engineering, 1979
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972