scispace - formally typeset
Journal ArticleDOI

An algorithm for diagnosis of system failures in the chemical process

Reads0
Chats0
TLDR
In order to eliminate carrying out the complicated and inefficient quantitative simulation, the mathematical model of the system structure to represent the rpopagation of failures is simplified in a qualitative fashion.
About
This article is published in Computers & Chemical Engineering.The article was published on 1979-01-01. It has received 334 citations till now. The article focuses on the topics: Graph (abstract data type) & Graph theory.

read more

Citations
More filters
Journal ArticleDOI

A Review of Process Fault Detection and Diagnosis Part I : Quantitative Model-Based Methods

TL;DR: This three part series of papers is to provide a systematic and comparative study of various diagnostic methods from different perspectives and broadly classify fault diagnosis methods into three general categories and review them in three parts.
Journal ArticleDOI

A review of process fault detection and diagnosis Part II : Qualitative models and search strategies

TL;DR: This part of the paper reviews qualitative model representations and search strategies used in fault diagnostic systems and broadly classify them as topographic and symptomatic search techniques.
Journal ArticleDOI

Applications of fault detection and diagnosis methods in nuclear power plants: A review

TL;DR: Popularity of FDD applications in NPPs will continuously increase as FDD theories advance and the safety and reliability requirement for NPP tightens.
Journal ArticleDOI

Challenges in the industrial applications of fault diagnostic systems

TL;DR: It is argued that a hybrid blackboard-based framework utilizing collective problem solving is the most promising approach and the efforts of the ASM consortium in pursuing the implementation of the state-of-the-art technologies at plant sites are described.
References
More filters
Journal ArticleDOI

Depth-First Search and Linear Graph Algorithms

TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
Related Papers (5)