应用Petri网求解事故树最小割集的方法研究  

Method for finding fault tree's minimal cut sets using petri nets

作　　者：崔焕庆[1] 周传爱[2] 

机构地区：[1]山东科技大学信息科学与工程学院,山东青岛266510 [2]青岛滨海学院综合学院,山东青岛266552

出　　处：《计算机工程与设计》2011年第2期580-583,共4页Computer Engineering and Design

基　　金：国家863高技术研究发展计划基金项目(2009AA062700);国家自然科学基金项目(60773034);青岛市科技计划基金项目(KZJ-47;2008-2-27;09-1-3-50-jch)

摘　　要：为简化事故树分析过程中最小割集求解算法的步骤,在构建事故树Petri网模型的基础上,探讨了事故树Petri网模型的性质,给出了事故树的逻辑表达式与事故树Petri网模型的可达死标识之间的关系,进而提出了利用Petri网可达图求解事故树最小割集的算法,以及在给定基本事件发生时,中间事件和顶事件发生与否的判断方法。结合实例,借助开源的Petri网工具PIPE实现了事故树最小割集的求解,表明了该算法的有效性和可行性。To simplify the algorithm of obtaining the minimal cut sets during fault tree analyzing, based on modeling the fault trees by Petri nets, the properties of Petri net models of fault trees are discussed, and the relationship between the logical expression of a fault tree and the reachable dead markings of its Petri net model is established. In further, the algorithm of obtaining minimal cut sets of a fault tree using the reachability graph of its Petri net is given, and the method is presented to judge whether middle and top events occur or not when some given basic events occur. With the open-source Petri net tool PIPE, the algorithm is implemented, and experiment shows that the algorithm is feasible and effective.

关 键 词：事故树 最小割集 PETRI网 可达图 死标识 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]