SFRs-based numerical simulation for the reliability of highly-coupled DFTS

Ge, Daochuan; Li, Dong; Meng, Lin; Yang, Yanhua

doi:10.17531/ein.2015.2.5

Cited by 14 publications

(6 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existing DFT analysis techniques can be classified into four main categories (as shown in Table 1): state space-based methods, [5][6][7][8] combinatorial methods, [9][10][11][12][13] simulation methods, [14][15][16][17][18][19][20] and other methods such as Bayesian networks (BNs), [21][22][23] dynamic Bayesian networks (DBNs), 24 and Petri nets (PNs). 25,26 Among these methods, state space-based and combinatorial approaches are analytical methods that can provide exact solutions.…”

Section: Introductionmentioning

confidence: 99%

An adapted component-connection method for building SBDD encoding a dynamic fault tree

Guo

Wang

Lin

et al. 2022

Proceedings of the Institution of Mechanical Engineers, Part O:

Self Cite

View full text Add to dashboard Cite

Dynamic fault trees (DFTs) are a commonly used tool to analyze the reliability of systems with sequential failure behaviors. A sum of disjoint product (SDP)-based analysis methods are widely accepted as efficient approaches for a DFT, such as dynamic binary decision trees (DBDTs) and sequential binary decision diagrams (SBDDs). However, for a large DFT, the process of obtaining the structure function is error-prone and very time-consuming. In contrast, SBDD built on the improved ite algorithm does not rely on the structure function but is limited to a DFT whose dynamic gates are located at the bottom. This method requires predefined variable ordering for basic events, which greatly influences the computational efficiency, and the caching operation is a problem. In this paper, an enhanced component-connection–based method is proposed to build SBDD encoding a DFT. New component-connection rules are developed to deal with dependent variables having repeated basic events, and several heuristic connection strategies are also developed to reduce the size of the final calculable terms. The proposed method is straightforward and easily implemented. To demonstrate the applications and merits of our method, several case studies are carried out, and the results show the reasonability and effectiveness.

show abstract

Section: Introductionmentioning

confidence: 99%

An adapted component-connection method for building SBDD encoding a dynamic fault tree

Guo

Wang

Lin

et al. 2022

Proceedings of the Institution of Mechanical Engineers, Part O:

Self Cite

View full text Add to dashboard Cite

show abstract

“…By contrast, Monte Carlo (MC) simulation and stochastic non‐Bernoulli sequences methods are considered to be two approximate numerical approaches. MC simulation methods can give system reliability indexes by simulating the failure processes of real systems, and these methods have notable merits in solving DFTs with complex structures and arbitrary time‐to‐failure input events.…”

Section: Introductionmentioning

confidence: 99%

“…Up to now, several kinds of analyzing approaches have been proposed. These methods are mainly classified into five categories: state-space-based approaches (i.e., Markov Chain model method), [8][9][10][11] combinatorial methods including inclusionexclusion principle (IEP) approaches [12][13][14] and sum of disjoint products (SDP) approaches, [15][16][17] simulation methods, [18][19][20][21][22][23] stochastic non-Bernoulli sequence methods, [24][25][26] and other methods. The detailed classifications are shown as listed in Figure 1.…”

Section: Introductionmentioning

confidence: 99%

“…Comparatively, SDP methods can avoid state space explosion and combinatorial explosion problems by converting DFTs into sum of disjoint products forms and have shown notable advantages on computing efficiency. [50][51][52] By contrast, Monte Carlo (MC) simulation 22,23 and stochastic non-Bernoulli sequences methods [24][25][26] are considered to be two approximate numerical approaches. MC simulation methods can give system reliability indexes by simulating the failure processes of real systems, and these methods have notable merits in solving DFTs with complex structures and arbitrary time-to-failure input events.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Negating a Generalized Cut Sequence: Bridging the Gap Between Dynamic Fault Trees Quantification and Sum of Disjoint Products Methods

Yang

2016

Qual. Reliab. Engng. Int.

Self Cite

View full text Add to dashboard Cite

Dynamic fault trees (DFTs) are powerful tools to model industrial systems having dynamic failure mechanisms, such as sequence‐ and function‐dependent failure behaviors. Yet for large and complex DFTs, their quantitative analyses are still of great challenges. Up to now, many researchers have presented several approaches to deal with this problem, and among which, the sum of disjoint products (SDP) methods, such as dynamic binary decision tree, sequential binary decision diagram (SBDD), and improved SBDD, have proven to be an efficient way. In SDP methods, negating a generalized cut sequence is an unavoidable task. Yet, for a complex cut sequence expression where normal, cold and warm spares basic events coexist, its negating operation is still difficult and needs to be further studied. In this paper, based on De Morgan theorem, improved explicit formulas for negating a generalized cut sequences are presented. The new concept of universal set of basic event and its operating rules are proposed to deduce the simplified expressions of general enforcing occurring cut sequences and warm spares occurring cut sequences. To validate the presented approaches, a typical system DFT is analyzed. The results indicate the reasonability and effectiveness of the improved negating formulas. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

“…Monte Carlo (MC) simulation methods [13][14][15] have been broadly used to evaluate complex DFTs modeling industrial systems with arbitrary distributed components, and they are often adopted as benchmarks to validate new proposed approaches. The problem is, as to small probability events, these methods often take a long computation time to get a desirable solution with high accuracy.…”

Section: Introductionmentioning

confidence: 99%

Quantitative analysis of dynamic fault trees using improved Sequential Binary Decision Diagrams

Meng

Yang

et al. 2015

Reliability Engineering & System Safety

Self Cite

View full text Add to dashboard Cite

SFRs-based numerical simulation for the reliability of highly-coupled DFTS

Abstract: The failure behaviors of many real-life systems are very complex and sequence-dependent, and can be modeled by highly-coupled dynamic fault trees (DFTs

Cited by 14 publications

References 23 publications

An adapted component-connection method for building SBDD encoding a dynamic fault tree

An adapted component-connection method for building SBDD encoding a dynamic fault tree

Negating a Generalized Cut Sequence: Bridging the Gap Between Dynamic Fault Trees Quantification and Sum of Disjoint Products Methods

Quantitative analysis of dynamic fault trees using improved Sequential Binary Decision Diagrams

Contact Info

Product

Resources

About