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

Dynamic labelling of BDD and ZBDD for efficient non-coherent fault tree analysis

Abstract: Binary Decision Diagram (BDD) based fault tree analysis algorithms are among the most efficient ones. They allow performing exact probabilistic analyses, as well as to derive a Zero-suppressed BDD (ZBDD) to efficiently encode Significant Prime Implicants (PI) or Minimal Cut Sets (MCS).The present paper describes a dynamic labelling method for BDD/ZBDD to analyse non-coherent fault trees. An L-BDD is a BDD in which the information about the variable type is associated to each node. This information is useful to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 17 publications
0
7
0
Order By: Relevance
“…However, there was also an obvious disadvantage that the probability calculation results were not accurate enough. Matuzas 16 proposed a BDD/ZBDD dynamic labeling method for incoherent FTA, called L‐BDD/TL‐BDD. However, in the face of complex FT, there was not enough working memory to store a large amount of generated L‐BDD.…”
Section: The Realization Methods Of Dftmentioning
confidence: 99%
See 1 more Smart Citation
“…However, there was also an obvious disadvantage that the probability calculation results were not accurate enough. Matuzas 16 proposed a BDD/ZBDD dynamic labeling method for incoherent FTA, called L‐BDD/TL‐BDD. However, in the face of complex FT, there was not enough working memory to store a large amount of generated L‐BDD.…”
Section: The Realization Methods Of Dftmentioning
confidence: 99%
“…In addition, there are some studies dedicated to F I G U R E 2 Trend of DFT-related publications expanding different dynamic gates to meet the needs of the actual system, which are reviewed and discussed in Section 3.1. To be clear, the DFT reviewed in this paper refers to the techniques that can analyze the dynamic analysis of top event based on the fault tree model, which does not necessarily include dynamic gates, such as, 15,16 and so on.…”
Section: Seq Gatementioning
confidence: 99%
“…Song et al [33] spread out FTA in Colored Petri nets to analyze the railway system reliability. Matuzas [34] and Deng [35] developed an upgraded Binary Decision Diagram (BDD) algorithm for improving FTA efficiency. Other examples include the use of dynamic FT [36,37] and Pandora temporal FT [38] for performing dependability analysis.…”
Section: Introductionmentioning
confidence: 99%
“…However, different approaches using artificial intelligence in risk analysis and with FTA especially were used. For depth and dynamic analysis, several techniques are used with FTA as the binary decision diagrams (BDD) used to encode efficiently FTA and calculation of minimal cut sets. The Monte Carlo (MC) simulation is designed for continuous–time models to compute the system reliability in FTA .…”
Section: Introductionmentioning
confidence: 99%