1989
DOI: 10.1109/24.31103
|View full text |Cite
|
Sign up to set email alerts
|

Direct evaluation of fault trees using object-oriented programming techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

1989
1989
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(8 citation statements)
references
References 5 publications
0
8
0
Order By: Relevance
“…e.g. Prime Implication(PI) [6,7] Binary Decision Diagram (BBD) [8], Markov regenerative stochastic Petri nets [9], Shannon expansion using truncation [10], Object oriented approaches [11], Factoring theorem [12], or Pattern recognition [13].However, UDMC is a repairable system, those method is not appropriate.…”
Section: A Methodology For Quantitative Reliability Analysismentioning
confidence: 97%
“…e.g. Prime Implication(PI) [6,7] Binary Decision Diagram (BBD) [8], Markov regenerative stochastic Petri nets [9], Shannon expansion using truncation [10], Object oriented approaches [11], Factoring theorem [12], or Pattern recognition [13].However, UDMC is a repairable system, those method is not appropriate.…”
Section: A Methodology For Quantitative Reliability Analysismentioning
confidence: 97%
“…The symbolic extension allows for both the situations where timings are unknown, or are known, but can vary. There have been a lot of approaches for characterizing diagnosis [4, 141 and its fault trees [5,13]~ However, our modelbased diagnosis supersedes others in that it intrinsically represents timing effects, especially in relation to task execution. Dynamic models are necessary in task execution application where effects of an anomaly occurring in some task are not apparent until they have propagated some time later, in some transformed manner, to a detectable error in another task.…”
Section: Brief Description On Symbolic Discrete Event System Specificmentioning
confidence: 98%
“…As commented above, the Minimal Cut Sets methods are widely used due to its performance advantages and not needing the data of all the basic events. However, an exact solution can only be achieved using the direct analysis evaluation, which involves creating a top-down recursive algorithm that directly analyzes the exact probability of the desired event, as shown by Patterson-Hine and Koen [28], not considering minimal cut sets or maximum order of cut sets.…”
Section: Direct Analysis Evaluationmentioning
confidence: 99%
“…Two of the quantitative analyses of a fault tree are specially used in the aviation sector, the main aim of the present communication: Minimal Cut Sets (MCS) [27] and Direct numerical Evaluation (DE) without computing the cut sets. Although the MCS approach produces an approximate result [28], it is widely used due to its good performance, the ability to truncate the number of cut sets as required, and because it is not necessary to input all the basic events. However, the Direct Evaluation of fault trees solves the tree exactly.…”
Section: Introductionmentioning
confidence: 99%