Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Analytic Methods to Calculate Fault Trees with Loops - Restrictions of Application and Solution Uniqueness (1602.03689v1)

Published 11 Feb 2016 in cs.SE

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.

Summary

We haven't generated a summary for this paper yet.