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

Ge, Daochuan; Meng, Lin; Yang, Yanhua; Zhang, Ruoxing; Chou, Qiang

doi:10.1016/j.ress.2015.06.001

Cited by 56 publications

(45 citation statements)

References 32 publications

(47 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As to how to judge whether or not a cut sequence is inclusive in another one, interested readers are encouraged to refer to Ge et al for more details.…”

Section: A Case Studymentioning

confidence: 99%

“…But it is worth noting that IEP methods are easily trapped in combinatorial explosion problem when the sizes of DFTs are very large. 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 …”

Section: Introductionmentioning

confidence: 99%

“…In our previous work, some adapted SDP‐based combinatorial approaches are proposed to solve DFTs, such as the adapted K.D. Heidtmann (KDH) algorithm, dynamic binary decision tree method, and improved SBDD . The adapted KDH algorithm can transform a DFT into an SDP form based on its structure function.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

“…As to how to judge whether or not a cut sequence is inclusive in another one, interested readers are encouraged to refer to Ge et al for more details.…”

Section: A Case Studymentioning

confidence: 99%

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

show abstract

“…DFT is widely used to model the dynamic systems as the extensions of the traditional static fault trees with sequence-and function-dependent failure behaviors. Ge et al present an improved sequential binary decision diagrams (SBDD) method for highly coupled DFT where different dynamic gates often coexist and interact sciENcE aNd tEchNology by repeated events [7]. A new approach was proposed by Merle et al to solve DFT with priority dynamic gate and repeated events [17].…”

Section: Introductionmentioning

confidence: 99%

Fault diagnosis for complex systems based on dynamic evidential network and multi-attribute decision making with interval numbers

Duan¹,

Longfei²,

Lin³

2017

EiN

View full text Add to dashboard Cite

Fault diagnosis For complex systems based on dynamic evidential network and multi-attribute decision making with interval numbers diagnostyka uszkodzeń systemu złożonego oparta na dynamicznych sieciach dowodowych oraz wieloatrybutowej metodzie podejmowania decyzji z wykorzystaniem liczb interwałowych The complexity of modern system structures and failure mechanisms makes it very difficult to locate the system fault. It has characteristics of dynamics of failure, diversity of distribution and epistemic uncertainties, which increase the challenges in the fault diagnosis significantly. This paper presents a fault diagnosis framework for complex systems within which the failure rates of components are expressed in interval numbers. Specifically, it uses a dynamic fault tree (DFT) to model the dynamic fault behaviors and deals with the epistemic uncertainties using Dempster-Shafer (D-S) theory and interval numbers. Furthermore, a solution is proposed to map a DFT into a dynamic evidential network (DEN) to calculate the reliability parameters. Additionally, diagnostic importance factor (DIF), Birnbaum importance measure (BIM) and heuristic information values (HIV) are taken into account comprehensively in order to obtain the best fault search scheme using an improved VIKOR algorithm. Finally, an illustrative example is given to demonstrate the efficiency of this method. Keywords: diagnosis strategy, D-S theory, interval numbers, dynamic evidential network, VIKOR.Złożoność However, these methods assume that all components obey to the same distribution and cannot handle the challenge (2). Furthermore, these methods, which are usually assumed that the failure rates of the components are considered as crisp values describing their reliability characteristics, have been found to be inadequate to deal with the challenge (3) mentioned above. Therefore, fuzzy sets theory has been introduced as a useful tool to handle the challenge (3). The fuzzy fault tree analysis model employs fuzzy sets and possibility theory, and deals with ambiguous, qualitatively incomplete and inaccurate information [8,16,18]. To deal with the challenge (1) and (3), fuzzy DFT analysis has been introduced [13][14] which employs a DFT to construct the fault model and calculates the reliability results based on the continuous-time BN under fuzzy numbers. However, these approaches cannot handle the challenge (2). For this purpose, Mi et al. proposed a new reliability assessment approach which used a DFT to model the dynamic characteristics within complex systems and estimated the parameters of different life distributions using the coefficient of variation (COV) method [19]. To a certain extent, this method can meet the above challenges. But it is confined to the reliability analysis and cannot be used for the fault diagnosis. Dugan introduced a diagnostic importance factor (DIF) to determine the diagnosis sequence using DFT analysis [1]. However, the solution for DFT is based on Markov Chain which has an apparent state space explosion problem. In the work...

show abstract

“…Mo developed a multi‐value, decision‐diagram‐based DFT analysis method to analyze the reliability of large dynamic systems based on the state explosion and computational efficiency problems in DFT model. Moreover, Ge et al presented an improved sequential binary decision diagram method for quantitative analysis of DFT with interactive repeated events. It should be noted that in view of the dynamic characteristic in modern complex systems and taking advantage of the dynamic modeling ability of DFT, a DFT model should be built on the basis of system structure and failure behaviors …”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

Binary State Reliability Computation for a Complex System Based on Extended Bernoulli Trials: Multiple Autonomous Robots

Fazlollahtabar

Niaki

2017

Quality & Reliability Eng

View full text Add to dashboard Cite

Availability of a system is a crucial factor for planning and optimization. The concept is more challenging for modern systems such as robots and autonomous systems consisting of a complex configuration of components. In this paper, a reliability evaluation framework is developed for a system of binary state autonomous robots in an automated manufacturing environment. In this framework, the concepts in functional block diagram, table of truth, and sum of state are employed simultaneously to develop a binary state reliability model. Due to inefficacy of the method for larger number of components involved in complex systems, an extension of the Bernoulli trials is proposed. In an implementation study, the effectiveness and computational efficiency of the proposed method are illustrated. In addition, an analysis on the failure rate using the maximum likelihood estimation and confidence interval is reported. Copyright © 2017 John Wiley & Sons, Ltd.

show abstract

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

Cited by 56 publications

References 32 publications

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

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

Fault diagnosis for complex systems based on dynamic evidential network and multi-attribute decision making with interval numbers

Binary State Reliability Computation for a Complex System Based on Extended Bernoulli Trials: Multiple Autonomous Robots

Contact Info

Product

Resources

About