2004
DOI: 10.1016/j.ress.2003.10.009
|View full text |Cite
|
Sign up to set email alerts
|

A fast BDD algorithm for large coherent fault trees analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
35
0
1

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 96 publications
(39 citation statements)
references
References 15 publications
0
35
0
1
Order By: Relevance
“…Mission P needs two components, 1 A and 2 A . Mission Q needs three components, 1 A , 3 A , and 4 A . During different time periods, component 1 A participates in mission P and mission Q .…”
Section: Bdd Examplementioning
confidence: 99%
See 3 more Smart Citations
“…Mission P needs two components, 1 A and 2 A . Mission Q needs three components, 1 A , 3 A , and 4 A . During different time periods, component 1 A participates in mission P and mission Q .…”
Section: Bdd Examplementioning
confidence: 99%
“…The second phase consists of 2 Q . The third phase consists of 3 P and 3 Q . The input parameters of each component are shown in Table 1, which shows the computed conditional reliability for each component at each phase, and all the components fail exponentially with constant failure rate.…”
Section: Bdd Examplementioning
confidence: 99%
See 2 more Smart Citations
“…A BDD is widely and efficiently used in reliability analysis [14,15,16,28]. Methods for transformation of a Fault Tree to the ordered BDD (OBDD) are proposed in papers [17,28]. These methods permit to substantiate the correct application of OBDD in reliability analysis.…”
Section: Introductionmentioning
confidence: 99%