.png){kind=icon}
返回
Fast Dynamic Fault Tree Analysis by Model Checking Techniques
.png){kind=icon}
PRE
AI
DOI：10.1109/TII.2017.2710316.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new state-space generation approach for dynamic fault trees (DFTs) that exploits several successful reduction techniques from the field of model checking. The key idea is to aggressively exploit the DFT structure-detecting symmetries, spurious non-determinism, and don't cares. Benchmarks show a gain of more than two orders of magnitude in terms of state-space generation and analysis time. This fast, scalable approach is complemented by an approximative technique that determines bounds on DFT measures by a partial state-space generation. This is shown to yield another order of magnitude gain while guaranteeing tight error bounds.
Keyword:
Dynamic fault trees (DFTs)
Markov automata
probabilistic model checking
reliability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.9
论文数:
8.3K
被引数:
6.0W
机构
引用论文
.png){kind=icon}
Quantitative analysis of dynamic fault trees using improved Sequential Binary Decision Diagrams
PREAI
分享收藏
查看更多内容