论文部分内容阅读
在事故树的定性和定量分析中,最小割集占有非常重要的地位。目前,求最小割集的方法很多,如福赛尔(Fussell)法等。本文介绍的是二进制编排法求最小割集,它在计算机的高速内存贮器中进行布尔代数处理,可以迅速并有效地计算出含有多个基本事件的大型事故树的最小割集。一、二进制编排法的步骤 1.用正整数1、2、……、N重新标记基本事件,其中N是事故树基本事件的总数。 2.从事故树最下面一层的逻辑门开始,用基本事件表示各个门的割集,然后将割集转换成二进制行。割集中某一基本事件的号码就等价于二进制行的一个位置。 3.按逻辑门的类型进行割集组合,并消除超集,逐渐推进到事故树最上面的一个
In the qualitative and quantitative analysis of the accident tree, the minimum cut sets occupy a very important position. At present, there are many ways to find the minimum cut set, such as the Fussell method. This paper introduces a binary cut method for minimum cut sets. It performs Boolean algebra processing in a high-speed internal memory of a computer and can quickly and efficiently calculate the minimum cut set of a large fault tree with multiple basic events. First, the steps of the binary choreography method 1. Re-mark the basic events with positive integers 1, 2, ..., N, where N is the total number of basic events of the accident tree. 2. Beginning with the logic gate at the bottom of the Fault Tree, use the base event to represent the cut sets for each gate, and then convert the cut set to a binary line. Cutting a certain number of basic events is equivalent to a binary line of a location. 3. According to the type of logic gates cutting combination, and eliminate the superset, gradually advancing to the top of the accident tree one