An improved minimal cut set algorithm

An improved minimal cut set algorithm Presents a new qualitative fault tree evaluation algorithm based on bit manipulation techniques for the identification of the largest independent sub‐trees and the subsequent determination of all minimal cut sets of large and complex fault trees. The methodology developed is validated by direct application to a complex fault tree taken from the literature. Results obtained are compared with those available in the literature. Shows that the use of the algorithm (FTABMT) developed results in significant savings in both computer time and storage requirements. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Quality & Reliability Management Emerald Publishing

Loading next page...
 
/lp/emerald-publishing/an-improved-minimal-cut-set-algorithm-LcWQ9sC7Fq
Publisher
Emerald Publishing
Copyright
Copyright © 1996 MCB UP Ltd. All rights reserved.
ISSN
0265-671X
DOI
10.1108/02656719610110069
Publisher site
See Article on Publisher Site

Abstract

Presents a new qualitative fault tree evaluation algorithm based on bit manipulation techniques for the identification of the largest independent sub‐trees and the subsequent determination of all minimal cut sets of large and complex fault trees. The methodology developed is validated by direct application to a complex fault tree taken from the literature. Results obtained are compared with those available in the literature. Shows that the use of the algorithm (FTABMT) developed results in significant savings in both computer time and storage requirements.

Journal

International Journal of Quality & Reliability ManagementEmerald Publishing

Published: Mar 1, 1996

Keywords: Algorithms; Computers; Evaluation; Qualitative techniques; Validation

References

  • The synthesis of fault trees
    Lapp, S.A.; Powers, G.J.
  • Fault tree synthesis for chemical process
    Powers, G.J.; Tompkins, F.C.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off