Access the full text.
Sign up today, get DeepDyve free for 14 days.
Dong Liu, Chunyuan Zhang, Weiyan Xing, Rui Li, Haiyan Li (2007)
Quantification of Cut Sequence Set for Fault Tree Analysis
T. Yuge, S. Yanagi (2006)
Quantitative analysis of a fault tree with priority AND gatesReliab. Eng. Syst. Saf., 93
Wei Long, Yoshinobu Sato, M. Horigome (2000)
Quantification of sequential failure logic for fault tree analysisReliab. Eng. Syst. Saf., 67
P. Zhang, K. Chan (2012)
Reliability Evaluation of Phasor Measurement Unit Using Monte Carlo Dynamic Fault Tree MethodIEEE Transactions on Smart Grid, 3
F. Chiacchio, L. Compagno, D. D'Urso, Gabriele Manno, N. Trapani (2011)
Dynamic fault trees resolution: A conscious trade-off between analytical and simulative approachesReliab. Eng. Syst. Saf., 96
F. Chiacchio, M. Cacioppo, D. D'Urso, Gabriele Manno, N. Trapani, L. Compagno (2013)
A Weibull-based compositional approach for hierarchical dynamic fault treesReliab. Eng. Syst. Saf., 109
O. Yevkin (2011)
An improved modular approach for dynamic fault tree analysis2011 Proceedings - Annual Reliability and Maintainability Symposium
L. Xing, O. Tannous, J. Dugan (2012)
Reliability Analysis of Nonrepairable Cold-Standby Systems Using Sequential Binary Decision DiagramsIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 42
Reza Pulungan, H. Hermanns (2008)
Effective Minimization of Acyclic Phase-Type Representations
Mansoor Alam, U. Al-Saggaf (1986)
Quantitative Reliability Evaluation of Repairable Phased-Mission Systems Using Markov ApproachIEEE Transactions on Reliability, 35
J. Dugan, S. Bavuso, M. Boyd (1993)
Fault trees and Markov models for reliability analysis of fault-tolerant digital systemsReliability Engineering & System Safety, 39
J. Dugan, S. Bavuso, M. Boyd (1992)
Dynamic fault-tree models for fault-tolerant computer systemsIEEE Transactions on Reliability, 41
R. Gulati, J. Dugan (1997)
A modular approach for analyzing static and dynamic fault treesAnnual Reliability and Maintainability Symposium
M. Bouissou, F. Bruyère, A. Rauzy (1997)
BDD Based Fault-Tree Processing
L. Xing, A. Shrestha, Yuan-Shun Dai (2011)
Exact combinatorial reliability analysis of dynamic systems with sequence-dependent failuresReliab. Eng. Syst. Saf., 96
O. Tannous, L. Xing, J. Dugan (2011)
Reliability analysis of warm standby systems using sequential BDD2011 Proceedings - Annual Reliability and Maintainability Symposium
O. Yevkin (2010)
An improved monte carlo method in fault tree analysis2010 Proceedings - Annual Reliability and Maintainability Symposium (RAMS)
H. Boudali, P. Crouzen, M. Stoelinga (2007)
Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)
Y. Ou, J. Dugan (2004)
Modular solution of dynamic multi-phase systemsIEEE Transactions on Reliability, 53
W. Jung (2009)
ZBDD algorithm features for an efficient Probabilistic Safety AssessmentNuclear Engineering and Design, 239
L. Xing, A. Shrestha, L. Meshkat, Wendai Wang (2009)
Incorporating Common-Cause Failures Into the Modular Hierarchical Systems AnalysisIEEE Transactions on Reliability, 58
G. Merle, J. Roussel, J. Lesage (2011)
Algebraic determination of the structure function of Dynamic Fault TreesReliab. Eng. Syst. Saf., 96
Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Y. Crama, Peter Hammer (2004)
Binary Decision Diagrams
A. Anand, Arun Somani (1998)
Hierarchical analysis of fault trees with dependencies, using decompositionAnnual Reliability and Maintainability Symposium. 1998 Proceedings. International Symposium on Product Quality and Integrity
C. Shannon (1938)
A symbolic analysis of relay and switching circuitsTransactions of the American Institute of Electrical Engineers, 57
H. Boudali, P. Crouzen, M. Stoelinga (2010)
A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree AnalysisIEEE Transactions on Dependable and Secure Computing, 7
M Stamatelatos, W Vesely (2002)
NASA Office of Safety and Mission Assurance, vol1.1
H. Boudali, P. Crouzen, M. Stoelinga (2007)
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
R. Bryant (1989)
Graph-based Algorithm for Boolean Function ManipulationIEEE Transactions on Computers
G. Merle, J. Roussel, J. Lesage (2014)
Quantitative Analysis of Dynamic Fault Trees Based on the Structure FunctionQuality and Reliability Engineering International, 30
K. Rao, G. Vinod, V. Rao, H. Kushwaha, A. Verma, A. Srividya (2009)
Dynamic fault tree analysis using Monte Carlo simulation in probabilistic safety assessmentReliab. Eng. Syst. Saf., 94
J. Fussell, E. Aber, R. Rahl (1976)
On the Quantitative Analysis of Priority-AND Failure LogicIEEE Transactions on Reliability, R-25
A. Rauzy, E. Châtelet, Y. Dutuit, C. Bérenguer (2003)
A practical comparison of methods to assess sum-of-productsReliab. Eng. Syst. Saf., 79
EJ Henley, H Kumamoto (1981)
Reliability Engineering and Risk Assessment
Many real‐life systems are typically involved in sequence‐dependent failure behaviors. Such systems can be modeled by dynamic fault trees (DFTs) with priority AND gates, in which the occurrence of the top events depends on not only combinations of basic events but also their failure sequences. To the author's knowledge, the existing methods for reliability assessment of DFTs with priority AND gates are mainly Markov‐state‐space‐based, inclusion–exclusion‐based, Monte Carlo simulation‐based, or sequential binary decision diagram‐based approaches. Unfortunately, all these methods have their shortcomings. They either suffer the problem of state space explosion or are restricted to exponential components time‐to‐failure distributions or need a long computation time to obtain a solution with a high accuracy. In this article, a novel method based on dynamic binary decision tree (DBDT) is first proposed. To build the DBDT model of a given DFT, we present an adapted format of the traditional Shannon's decomposition theorem. Considering that the chosen variable index has a great effect on the final scale of disjoint calculable cut sequences generated from a built DBDT, which to some extent determines the computational efficiency of the proposed method, some heuristic branching rules are presented. To validate our proposed method, a case study is analyzed. The results indicate that the proposed method is reasonable and efficient. Copyright © 2015 John Wiley & Sons, Ltd.
Applied Stochastic Models in Business and Industry – Wiley
Published: Nov 1, 2015
Keywords: ; ; ; ;
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.