基于动态事件树的风险关键状态搜索算法

关键状态是系统风险演化中的重要环节，识别关键状态对系统风险控制等具有重要意义。首先结合动态事件树基本方法给出了一类关键状态和关键事件的数学定义，然后提出了此类关键状态的两种搜索算法--基于子树分解的搜索（sub-tree decomposition, STD）算法和基于逻辑运算的搜索（boolean calculation, BC）算法，并对其计算量进行了对比分析。最后，利用本文所提出的算法对一个冷却缓冲装置进行了示例分析，验证了该算法的有效性和可行性。

Searching algorithms of risk key states based on dynamic event tree

Key states impact on the risk of system remarkably, so the identification of key states is significant for system risk control. Firstly, combined with the basic methodology of dynamic event tree, the mathematical definitions of one type of key states and key events are presented. In addition, two algorithms for searching the key states are proposed respectively: sub-tree decomposition(STD) based and boolean calculation(BC) based, and a contrastive analysis on their calculating amounts is provided as well. Finally, the validity and feasibility of the algorithms are demonstrated by a case analysis on a cooling buffer device in which the key states are searched.