Analytic Methods to Calculate Fault Trees with Loops - Restrictions of Application and Solution Uniqueness

February 11, 2016 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sergey Porotsky arXiv ID 1602.03689 Category cs.SE: Software Engineering Citations 0 Venue arXiv.org Last Checked 5 months ago
Abstract
One of the important tasks of the Reliability Estimation is Analysis of the Fault Tree. A problem of Fault Trees analysis is considered one of the most complex ones, since structure of such trees is characterized by a considerable number of interconnections. Usually analytical methods are used and most applicable method is Minimal Cut Sets building and calculation. Classical Fault Tree Analysis methods are applicable only for Fault Trees without loops. Loops can appear in Fault Tree, when a TOP or some intermediate gates appear as input to another gate at a lower level of the model. An occurrence of a Loop has been a problematic issue in a Fault Tree calculation. The article relates to the uniqueness of the solution for the Fault Trees with arbitrary Loops. There are assumed, that failures of the Basic Events are non-repairable and Fault Tree gates may be expressed by two main logic gates.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Software Engineering

Died the same way β€” πŸ‘» Ghosted