A rule-based approach to fault diagnosis using the signed directed graph
TL;DR: A very efficient method of identifying the possible causes of process disturbances using the signed directed graph (digraph) representation of process interactions and can be integrated with other rules on plant operations using an expert systems framework.
Abstract: Fault diagnosis is the problem of determining the root causes of process upsets. This paper presents a very efficient method of identifying the possible causes of process disturbances using the signed directed graph (digraph) representation of process interactions. The analysis is based on forming logical statements (rules) derived from the process digraph; these are evaluated using on-line data to yield the diagnosis. Evaluation of rule antecedents is more efficient than the previous algorithmic approach of Shiozaki et al. In the rule-based approach, the diagnostic criteria are represented explicitly, not hidden by a complex algorithmic procedure. This allows the diagnostic rules to be tailored to reflect the best available knowledge of plant behavior. The rules generated by this technique can be integrated with other rules on plant operations using an expert systems framework.
Citations
More filters
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.
2,263 citations
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.
1,415 citations
Cites methods from "A rule-based approach to fault diag..."
...The resulting SDG is converted into equivalent rules as discussed by Kramer and Palowitch (1987) and solved....
[...]
...Rule based method using SDG has been used for fault diagnosis by Kramer and Palowitch (1987)....
[...]
...Rule based method using SDG has been used for fault diagnosis by Kramer and Palowitch (1987) ....
[...]
...The resulting SDG is converted into equivalent rules as discussed by Kramer and Palowitch (1987) and solved....
[...]
358 citations
TL;DR: Popularity of FDD applications in NPPs will continuously increase as FDD theories advance and the safety and reliability requirement for NPP tightens.
289 citations
Cites background from "A rule-based approach to fault diag..."
...…in the literature include qualitative reasoning (De Kleer and Brown,1984) (Weld and De Kleer, 1990) (Kuipers, 1994) (Iwasaki, 1997), signed directed graph (Iri et al., 1979) (Umeda et al., 1980) (Kramer and Palowitch, 1987), and case-based reasoning (Aamodt and Plaza, 1994) (Watson andMarir,1994)....
[...]
TL;DR: This is a bibliography of signed graphs and related mathematics, where work on weighted graphs are regarded as outside the scope of the bibliography — except (to some extent) when the author calls the weights "signs".
Abstract: A signed graph is a graph whose edges are labeled by signs. This is a bibliography of signed graphs and related mathematics. Several kinds of labelled graph have been called "signed" yet are mathematically very different. I distinguish four types: Group-signed graphs: the edge labels are elements of a 2-element group and are multiplied around a polygon (or along any walk). Among the natural generalizations are larger groups and vertex signs. Sign-colored graphs, in which the edges are labelled from a two-element set that is acted upon by the sign group: - interchanges labels, + leaves them unchanged. This is the kind of "signed graph" found in knot theory. The natural generalization is to more colors and more general groups — or no group. Weighted graphs, in which the edge labels are the elements +1 and -1 of the integers or another additive domain. Weights behave like numbers, not signs; thus I regard work on weighted graphs as outside the scope of the bibliography — ex cept (to some extent) when the author calls the weights "signs". Labelled graphs where the labels have no structure or properties but are called "signs" for any or no reason.
258 citations