计算机科学 ›› 2019, Vol. 46 ›› Issue (1): 226-231.doi: 10.11896/j.issn.1002-137X.2019.01.035

• 软件与数据库技术 • 上一篇    下一篇

基于线性时间算法的故障树模块扩展分解方法

宋俊花, 魏欧   

  1. (南京航空航天大学计算机科学与技术学院 南京210016)
  • 收稿日期:2017-12-04 出版日期:2019-01-15 发布日期:2019-02-25
  • 作者简介:宋俊花(1993-),女,硕士生,主要研究方向为复杂系统分析与验证,E-mail:jhsong@nuaa.edu.cn;魏 欧(1974-),男,博士,副教授,主要研究方向为形式化方法、软件自动验证,E-mail:owei@nuaa.edu.cn(通信作者)。
  • 基金资助:
    国家自然科学基金项目(61170043),国家重点基础研究发展计划-973计划(2014CB744904)资助

Fault Tree Module Expansion Decomposition Method Based on Liner-time Algorithm

SONG Jun-hua, WEI Ou   

  1. (College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China)
  • Received:2017-12-04 Online:2019-01-15 Published:2019-02-25

摘要: 故障树分析被广泛应用于核工业、航空航天和交通控制等安全攸关领域的安全性分析中。然而,像核电站等大型工业所使用的大型故障树的分析需要耗费大量的计算资源,导致分析效率低下,时间消耗过多。为了解决此问题,对现有的线性时间算法进行改进,提出新的故障树简化规则和模块扩展分解算法。首先提出等效事件的概念,扩展线性时间算法所分解的模块数;在考虑时间复杂度和资源利用率的基础上,提出一套新的简化规则,以合理地去除故障树中的冗余信息。实验证明,提出的分解方法能有效地优化故障树分析,进一步减少大型故障树分析的计算时间和内存消耗。

关键词: 等效事件, 故障树分解, 简化, 模块扩展

Abstract: Fault tree is widely used to analyze the security in many safety-critical fields including nuclear industry,aerospace engineering and traffic control.However,large amount of computation resources are consumed when large-scaled fault tree is analyzed in major industries such as nuclear power station,leading to low efficiency and excessive time consumption.In order to solve this problem,this paper made several extensions based on existing linear-time algorithm,and proposed a new fault tree reduction rules and modular derivation based decomposition algorithm.Firstly,the concept of equivalent event is presented to extend the number of modules decomposed by linear-time algorithm.Based on the consideration of time complexity and resource utilization,new reduction rules are proposed to get rid of the redundant information in fault tree.Experimental results show that the proposed decomposition method can optimize the fault tree ana-lysis effectively,and reduce the time consumption and memory usage when dealing with the large-scaled fault tree.

Key words: Equivalent events, Fault decomposition, Module expansion, Simplification

中图分类号: 

  • TP311
[1]VESELY W E.Fault tree Handbook[J/OL].U.s.nuclear Regulatory Commission Washington,http://xueshu.baidu.com/s?wd=paperuri%3A%2814eb29c24997cefbf1482a3df590f622%29&filter=sc_long_sign&sc_ks_para=q%3DFault%20Tree%20Handbook&sc_us=&tn=SE_baiduxueshu_c1gjeupa&ie=utf-8.<br /> [2]ZHONGXIN X,WEI C.System Safety Design and Assessment in Civil Aircraft[M].Shanghai:Shanghai Jiao Tong University,2013.<br /> [3]BENGIAMIN N N,BOWEN B A,SCHENK K F.An Efficient Algorithm for Reducing the Complexity of Computation in Fault Tree Analysis[J].IEEE Transactions on Nuclear Science,1976,23(5):1442-1446.<br /> [4]PLATZ O,OLSEN J V.FAUNET:A Program Package for Evaluation of Fault Trees and Networks[J/OL].https://core.ac.uk/display/13791161.<br /> [5]SUN H,ANDREWS J D.Identification of independent modules in fault trees which contain dependent basic events[J].Reliability Engineering & System Safety,2004,86(3):285-296.<br /> [6]CAMARINOPOULOS L,YLLERA J.An Improved Top-down Algorithm Combined with Modularisation as a Highly Efficient Method for Fault Tree Analysis[J].Reliability Engineering,1985,11(2):93-108.<br /> [7]KOHDA T,HENLEY E J,INOUE K.Finding modules in fault trees[J].IEEE Transactions on Reliability,1989,38(2):165-176.<br /> [8]ROSENTHAL A.Decomposition methods for fault tree analysis [J].IEEE Transactions on Reliability,1980,29(2):136-138.<br /> [9]YLLERA J.Modularization methods for evaluating fault tree of complex technical system[J].Engineering Risk and Hazard Assessment,1988,2:81-100.<br /> [10]WILSON J M.Modularizing and Minimizing Fault Trees[J].IEEE Transactions on Reliability,1985,34(4):320-322.<br /> [11]DUTUIT Y,RAUZY A.A linear-time algorithm to find modules of fault trees[J].IEEE Transactions on Reliability,1996,45(3):422-425.<br /> [12]RAITERI D C,IACONO M,FRANCESCHINIS G,et al.Repairable Fault Tree for the Automatic Evaluation of Repair Policies//International Conference on Dependable Systems and Networks.IEEE Computer Society,2004:659.<br /> [13]TARJAN E.Depth first search and linear graph algorithms[J].Siam Journal on Computing,1972,1(4):114-121.<br /> [14]DENG Y,WANG H,GUO B.BDD algorithms based on modularization for fault tree analysis[J].Progress in Nuclear Energy,2015,85:192-199.<br /> [15]A repository of fault tree benchmark[OL].http://web.arch-ive.org/web/20061204235930/http://iml.univ_mrs.fr/~arauzy.arilia/benchmark.html<br /> [16]WEILIN L,OU W,MINGYU H.Computing minimal cut sets of fault tree using SAT solver[J].Computer Engineering and Scien-ce,2017,39(4):725-733.<br /> [17]LUO W,WEI O.WAP:SAT-Based Computation of Minimal Cut Sets[C].IEEE International Symposium on Software Reliability Engineering.IEEE Computer Society,2017:146-151.<br /> [18]CONTINI S,MATUZAS V.Analysis of large fault trees based on functional decomposition[J].Reliability Engineering & System Safety,2011,96(3):383-390.<br /> [19]MATUZAS V,CONTINI S.On the efficiency of functional decomposition in fault tree analysis[J].Proceedings of the Institution of Mechanical Engineers Part O Journal of Risk & Reliabi-lity,2012,226(6):635-645.<br /> [20]CONTINI S,MATUZAS V.Coupling decomposition and truncation for the analysis of complex fault trees[J].Proceedings of the Institution of Mechanical Engineers Part O Journal of Risk &Reliability,2012,226(3):249-261.
[1] 胡聪, 何晓晖, 邵发明, 张艳武, 卢冠林, 王金康.
基于极大极稳定区域及SVM的交通标志检测
Traffic Sign Detection Based on MSERs and SVM
计算机科学, 2022, 49(6A): 325-330. https://doi.org/10.11896/jsjkx.210300117
[2] 任帅, 王萌, 范傲雄, 高泽, 徐解, Shahzad KHURRAM, 张弢.
一种零高分辨率3D网格模型的信息隐藏算法
Zero-high-resolution Information Hiding Algorithm for 3D Mesh Model
计算机科学, 2020, 47(7): 328-334. https://doi.org/10.11896/jsjkx.190800021
[3] 包晓安, 鲍超, 金瑜婷, 陈春宇, 钱俊彦, 张娜.
基于动态调整简化粒子群优化的组合测试用例生成方法
Combinatorial Test Case Generation Method Based on Simplified Particle Swarm Optimizationwith Dynamic Adjustment
计算机科学, 2018, 45(11): 199-203. https://doi.org/10.11896/j.issn.1002-137X.2018.11.031
[4] 祁建军,魏玲.
三元背景及概念三元格的简化
Simplification of Triadic Contexts and Concept Trilattices
计算机科学, 2017, 44(9): 53-57. https://doi.org/10.11896/j.issn.1002-137X.2017.09.010
[5] 董天阳,姚佳洁,纪磊.
面向网络应用的三维树木模型简化方法研究
Research on Three-dimensional Tree Model Simplification for Web Applications
计算机科学, 2016, 43(Z6): 142-148. https://doi.org/10.11896/j.issn.1002-137X.2016.6A.034
[6] 聂仁灿,姚绍文,周冬明.
基于简化脉冲耦合神经网络的人脸识别
Face Recognition Using Simplified Pulse Coupled Neural Network
计算机科学, 2014, 41(2): 297-301.
[7] 赵晔,周畅,王昌.
一种随机采样的特征保持的网格简化算法
Feature Preserved Mesh Simplification Algorithm Based on Stochastic Sampling
计算机科学, 2011, 38(5): 249-251.
[8] 张迎春,王宇新,郭禾.
基于有序差别集和属性重要性的属性约简
Attribute Reduction Based on Ordered Discernibility Set and Significance of Attribute
计算机科学, 2011, 38(10): 243-247.
[9] 徐章艳,舒文豪,钱文彬,杨炳儒.
基于序关系的快速计算正区域核的算法
Quick Algorithm for Computing Core of the Positive Region Based on Order Relation
计算机科学, 2010, 37(7): 208-211.
[10] 赵涓涓,陈俊杰,李国庆.
图像情感语义规则简化学习算法
Algorithm of Simplifying the Image Emotion Semantic Rules
计算机科学, 2009, 36(10): 240-243.
[11] 崔霞 高建华.
一种新的测试集简化的测试覆盖准则

计算机科学, 2009, 36(1): 244-246.
[12] 付鑫 陈睿 唐雁.
基于频度中心理论的三维模型简化方法

计算机科学, 2008, 35(7): 216-218.
[13] .
基于简化的二进制差别矩阵的快速属性约简算法

计算机科学, 2006, 33(4): 155-158.
[14] 杨祥茂 丁晓明 谭曦 周启海.
基于均衡模型的计算机资源分配

计算机科学, 2005, 32(4): 171-172.
[15] 彭青松 张佑生 汪荣贵.
Bayesian网的独立性推广模型

计算机科学, 2005, 32(2): 182-184.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!