Minimal cut set/sequence generation for dynamic fault trees

Zhihua Tang · J.B. Dugan

110 citations0/0 files storedAnnual Reliability and Maintainability Symposium (RAMS)

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 Formal Methods in Verification Engineering and Test Systems

Abstract

This paper proposes a zero-suppressed binary decision diagrams (ZBDD) based solution for minimal cut set/sequence (MCS) generation of dynamic fault trees. ZBDD is an efficient data structure for combinational set representation and manipulation. Our solution is based on the basic ZBDD set manipulations (union, intersection, difference and product). Due to the nature of the ZBDD, our algorithm is more efficient than the algorithms based on the BDD, both in computation time and memory usage. In our solution, we also extend the concept of minimal cut set in static fault trees into minimal cut sequence (also with notation MCS) in dynamic fault trees. The is based on minimal cut set generation. It is also efficient compared with Markov model based methods. As an example, we apply our method to X2000 avionics architecture. The system is modeled using a dynamic fault tree and the minimal cut sets/sequences are generated and analyzed.

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 — 110 citations exist upstream.

References

1993New algorithms for fault trees analysis 2009Probabilistic Risk Assessment 1997Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia 1993Fault trees and Markov models for reliability analysis of fault-tolerant digital systems 2001Mathematical foundations of minimal cutsets

Cited by

2008Qualitative temporal analysis: Towards a full implementation of the Fault Tree Handbook 2008Quantitative analysis of a fault tree with priority AND gates 2018Quantitative Analysis of Dynamic Fault Trees by means of Monte Carlo Simulations: Event-Driven Simulation Approach 2013Quantitative Analysis of Dynamic Fault Trees Based on the Structure Function 2016Uncovering Dynamic Fault Trees 2007Compositional Temporal Fault Tree Analysis 2007Quantification of Cut Sequence Set for Fault Tree Analysis 2011Sequence Algebra, Sequence Decision Diagrams and Dynamic Fault Trees

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.