An Algorithm for Reducing Cut Sets in Fault-Tree Analysis

Nikolaos Limnios · R. Ziani

14 citations0/0 files storedIEEE Transactions on Reliability

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Risk and Safety Analysis Reliability and Maintenance Optimization Engineering and Test Systems

Abstract

The main goal of a fault-tree algorithm is to obtain the minimal cut sets as quickly as possible. This paper presents a new algorithm for cut-set reduction; it is based on the partition of the cut sets into two families: Those containing repeated events, and others. It is proved that only those containing repeated events need reduction. This algorithm was implemented by a computer program which had been associated with MOCUS algorithm, both developed on a microcomputer. This algorithm can be combined with other reduction algorithms. We believe that this algorithm is efficient.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 14 citations exist upstream.

References

1985Fault Tree Analysis, Methods, and Applications ߝ A Review 1977Reliability and Fault Tree Analysis 1972New methodology for obtaining cut sets for fault trees 1978FATRAM-A Core Efficient Cut-Set Algorithm 1976An Efficient Algorithm for Reducing the Complexity of Computation in Fault Tree Analysis

Cited by

2011Efficient Analysis of Fault Trees with Voting Gates

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.