Probabilistic analysis of fault trees using pivotal decomposition.
McCullers, William T. III
Wood, R. Kevin
Esary, James D.
MetadataShow full item record
An algorithm is presented for computing the exact failure probability for binary systems represented as fault trees. This algorithm does not rely on cut sets. Instead, it applies recursive pivotal decomposition together with probabilistic structural reductions and modularization directly to the fault tree. A further capability of the algorithm is the sequential printing of equations to form a function for a specific fault tree which computes system failure probability given the basic event probabilities.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ...
Adaptive selections of sample size and solver iterations in stochastic optimization with applicåation to nonlinear commodity flow problems Vondrak, David A. (Monterey, California. Naval Postgraduate School, 2009-03);We present an algorithm to approximately solve certain stochastic nonlinear programs through sample average approximations. The sample sizes in these approximations are selected by approximately solving optimal control ...