首页> 外文期刊>Quality and Reliability Engineering International >An Efficient Approximate Markov Chain Method in Dynamic Fault Tree Analysis
【24h】

An Efficient Approximate Markov Chain Method in Dynamic Fault Tree Analysis

机译:动态故障树分析中的有效近似马尔可夫链方法

获取原文
获取原文并翻译 | 示例
       

摘要

Approximate Markov chain method for dynamic fault tree analysis is suggested for both reparable and non-reparable systems. The approximation is based on truncation, aggregation and elimination of Markov chain states during the process of dynamic fault tree transformation to corresponding Markov chain. The method is valid for small probabilities. For reparable systems, it is true if mean time to repair is much less than mean time to failure. Several examples are studied. Additional simplification is considered in case the system is in a steady state. Copyright (c) 2015 John Wiley & Sons, Ltd.
机译:对于可修复和不可修复的系统,建议采用用于动态故障树分析的近似马尔可夫链方法。近似基于在动态故障树转换为相应的马尔可夫链的过程中对马尔可夫链状态的截断,聚集和消除。该方法对小概率有效。对于可修复的系统,如果平均维修时间比平均故障时间短很多,这是事实。研究了几个例子。如果系统处于稳定状态,则可以考虑进行其他简化。版权所有(c)2015 John Wiley&Sons,Ltd.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号