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

Rare-Event Estimation for Dynamic Fault Trees (1601.07189v1)

Published 24 Jan 2016 in stat.AP and cs.CE

Abstract: Article describes the results of the development and using of Rare-Event Monte-Carlo Simulation Algorithms for Dynamic Fault Trees Estimation. For Fault Trees estimation usually analytical methods are used (Minimal Cut sets, Markov Chains, etc.), but for complex models with Dynamic Gates it is necessary to use Monte-Carlo simulation with combination of Importance Sampling method. Proposed article describes approach for this problem solution according for specific features of Dynamic Fault Trees. There are assumed, that failures are non-repairable with general distribution functions of times to failures (there may be Exponential distribution, Weibull, Normal and Log-Normal, etc.). Expessions for Importance Sampling Re-Calculations are proposed and some numerical results are considered

Summary

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