期刊文献+

一种基于事件序列的故障树最小割集算法

An Effective Event Sequence-Based Algorithm to MCS
下载PDF
导出
摘要 在系统分析故障树最小割集各种求解算法的基础上,提出了一种故障树事件序列的数据结构,并针对该数据结构,设计了一种高效的故障树最小割集求解算法,并对其替换子算法、复制子算法和消减子算法进行了形式化描述。算法可有效降低最小割集生成中的"组合爆炸"问题,实验结果表明算法具有较好的计算性能。 With the detailed analysis to MCS,a new data structure fault tree event sequence is designed. By the data structure,An Effective Event Sequence- Based Algorithm to MCS is presented and its subprogram, which is primarily composed of replace subprogram, clone subprogram and reduction subprogram. The algorithm can effectively eliminate the combination blast problem in the determining of the MCS,The test results show that the algorithm has a better computed capacity.
出处 《航空计算技术》 2009年第2期18-20,32,共4页 Aeronautical Computing Technique
基金 学院创新基金(200519)
关键词 故障树 事件 最小割集 结构函数 fault tree event MCS structure function
  • 相关文献

参考文献7

二级参考文献16

  • 1方逵,周经伦,吴涛.故障树计算的一种新方法[J].模糊系统与数学,1996,10(4):83-89. 被引量:3
  • 2[1] Dutuit Y. A Linear-time Algorithm to Find Modules of Fault Tree [J]. IEEE Transactions on Reliability, 1996, 45(3): 423-425.
  • 3[2] Anand A. Hiearchical Analysis of Fault Trees with Dependencies, Using Decomposition[C]. RAMS Proceedings, 1998.69-75.
  • 4[3] Camarinopoulous L, Yllera J. An Improved Top-down Algorithm Combined With Modularization as Highly Efficient Method for Fault Tree Analysis [J]. Reliability Engineering, 1985, 11(6): 93-108.
  • 5[4] Kohda T. Finding Modules in Fault Tree [J]. IEEE Trans. Reliability, 1989, 38(3): 165-176.
  • 6[5] Aralia G. Computation of Prime Implicants of a Fault Tree within Aralia [C]. Proceedings of European Safety and Reliability Association, 1995.190-202.
  • 7[6] Tarjan R E. Depth First Search and Linear Graph Algorithm [J]. Computer, 1972, 1(4): 146-160.
  • 8方逵,罗强,温熙森.用矩阵法FTA进行非单调关联系统的早期不交化[J].国防科技大学学报,1997,19(2):85-89. 被引量:3
  • 9梅启智,系统可靠性工程基础,1992年
  • 10章国栋,系统可靠性与维修性分析与设计,1990年

共引文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部