1983
DOI: 10.1109/tr.1983.5221727
|View full text |Cite
|
Sign up to set email alerts
|

Fault-Tree Analysis by Fuzzy Probability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
189
0
3

Year Published

1999
1999
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 354 publications
(211 citation statements)
references
References 5 publications
1
189
0
3
Order By: Relevance
“…Such data can be obtained from experts' evaluations or possibility of fuzzy clustering [26,27]. These possibilities correspond to a membership function of fuzzy data [28]. This demand for initial data representation is caused by the method of FDT induction.…”
Section: A the Repository For Data Collectionmentioning
confidence: 99%
See 1 more Smart Citation
“…Such data can be obtained from experts' evaluations or possibility of fuzzy clustering [26,27]. These possibilities correspond to a membership function of fuzzy data [28]. This demand for initial data representation is caused by the method of FDT induction.…”
Section: A the Repository For Data Collectionmentioning
confidence: 99%
“…Entropy and information have been introduced to the information theory as a probabilistic approach. The application of these measures assumes that the sum of possibilities of all values of every attribute equals 1 [26,27,28]. Note that the likelihood of attribute's value in terms of FDT induction is measured as confidence degree or degree of truth in this value.…”
Section: System Reliabilitymentioning
confidence: 99%
“…The first implementation of fuzzy method in the context of fault tree analysis was pioneered by Science Publications AJEAS (Tanaka et al, 1983), who treated imprecise probabilities of basic events as trapezoidal fuzzy numbers and employed the extension principle to describe the logical relationships leading to the top event. Furuta and Shiraishi (1984) also proposed a kind of importance measure but by means of max/min fuzzy operator and fuzzy integrals other than Tanaka's approach.…”
Section: Fault Tree Analysismentioning
confidence: 99%
“…These bounds are referred to as the zero-cut and one-cut, respectively, as they mark the sets where the membership function is greater than or equal to zero and one. (In general, an a-cut is the set where the membership function is greater than or equal to a [21].) The fuzzy failure rate or population may be listed as a four-element vector, with the one-cut surrounded by the zero-cut.…”
Section: Fuzzy Markov Modelsmentioning
confidence: 99%
“…We initially investigated methods similar to those used for fuzzy fault trees [10,11,21]. For these it can be suf®cient to propagate the various corresponding a -cut end points through the fault tree as if they were crisp, and then take the resulting extremal points as the corners of the output possibility distribution [10,13,14,21].…”
Section: Inappropriate Fuzzy Markov Modelsmentioning
confidence: 99%