共查询到17条相似文献,搜索用时 136 毫秒
1.
在割序集(CSS)模型中,为了将由动态故障树(DFT)转换得到的CSS初级形式整理为最小割序集(MCSS),提出了顺序失效符(SFS)的推演规则。该推演规则依据基本事件的发生顺序和顺序失效符建立,包含结合律、或分配律、与分配律、吸收律、CSP规则、WSP规则等。给出了各类规则的证明过程,并列举了现实中不存在的割序以及由推演规则推导得出的导出规则。SFS推演规则是CSS模型定性分析的进一步形式化描述,它不仅解决了自动获得动态系统最小割序集的问题,而且可在此基础上开展计算机辅助工具的设计工作。 相似文献
2.
动态故障树的不交化定量分析方法 总被引:1,自引:0,他引:1
动态故障树被广泛应用于动态系统的可靠性分析中,其中割序描述了系统的失效模式,割序集的不交化可以简化顶点失效概率的求解,目前还没有有效的适用于动态故障树的不交化定量分析方法.提出了一种不交化定量分析方法:在割序的基础上融入时序逻辑提出扩展割序的概念,其与以往类似概念相比增强了表达能力;根据基事集和时限集分解最小扩展割序集,将其转换成不交化扩展割序集;再将不交化扩展割序转换成标准扩展割序,然后对其各割项进行冲突检测、时限集精简、基事集拓扑排序,以对标准扩展割序进行量化计算;并对该方法所涉及到的算法进行了详细的证明和时间复杂性分析.最后将其应用到一个案例中,并同基于inclusion-exclusion规则的MCS方法进行了对比,实验结果显示该方法的时间开销明显降低.该方法可以获得动态故障树的不交化扩展割序集,降低求解时间开销. 相似文献
3.
4.
5.
针对UML活动图在生成故障树的过程中只能反映活动事件流故障导致的系统失效,不能反映系统静态状态故障的问题,提出了一种活动图结合类图生成故障树的方法。在原有活动图的基础上,使用类图增加系统静态状态信息,设计活动图和类图到故障树模型的转换规则,将活动图中动态行为信息和类图静态状态信息转化为故障树中的节点要素。基于转换规则设计算法逆向遍历活动图和类图,自顶向下生成故障树。经过实例建模生成故障树,表明该方法能反映系统的动态行为和静态状态两方面的故障信息,为故障树生成提供了一种新的有效途径。 相似文献
6.
7.
在分析基于Pandora的动态故障树时,SBDD方法未考虑各底事件间复杂的关系,造成生成的SBDD中存在无效分支,即计算的不交化割集中存在无效割集。针对该问题,提出了一种基于动态故障树的SBDD方法,可以动态删除无效节点,避免无效分支的产生。该方法主要包括两个方面:基于结构式排序方法的关系式排序方法和动态优化SBDD生成算法。关系式排序方法的基本思想是利用故障树的结构关系和底事件间的关系给底事件赋予不同的排序优先级。在底事件排序队列的基础上,使用动态优化SBDD生成算法来生成SBDD。在计算过程中,该算法动态删除无效的节点,使结果中不存在无效割集。实验结果表明,在相近的时间内,使用基于动态故障树的SBDD方法生成的SBDD规模更小,不交化割集数目更少且不存在无效割集。 相似文献
8.
9.
基于BDD的关联故障树定量分析法研究 总被引:4,自引:0,他引:4
利用二元决策图(BDD)中的B—割集和节点概率,提出了基于BDD的关联故障树定量分析新算法。推导了故障树顶事件发生概率和绝对失效强度算法公式,将故障树顶事件发生概率和绝对失效强度计算结合起来,避免了复杂的最小割集和不交化求解过程,显著地减少了布尔代数运算量,给出了算法递归步骤。大量的实例分析验证了此算法的工程实用性。 相似文献
10.
针对动车组差动保护系统,结合其故障机理及时序特点,构建动态故障树模型,利用马尔可夫蒙特卡洛方法,结合贝叶斯估计法和最大似然估计优点的混合算法来估计动态故障树各底事件的概率分布函数,构造顶事件的布尔函数,利用固定时间步长仿真法进行蒙特卡洛仿真分析求得系统故障概率分布函数,发现绕组故障对顶事件贡献度最高,底事件中锈蚀、谐振、外部短路等对于系统可靠性的重要度较大,可作为制订动车组差动保护系统检修策略的参考,为系统元件改进的优先顺序提供帮助. 相似文献
11.
Takehisa Kohda 《国际自动化与计算杂志》2006,3(2):151-156
Minimal cut sets (or prime implicants: minimal combinations of basic event conditions leading to system failure) are important information for reliability/safety analysis and design. To obtain minimal cut sets for general non-coherent fault trees, including negative basic events or multi-valued basic events, a special procedure such as the consensus rule must be applied to the results obtained by logical operations for coherent fault trees, which will require more steps and time. This paper proposes a simple method for a non-coherent fault tree, whose top event is represented as an AND combination of monotonic sub-trees. A "monotonic" sub-tree means that it does not have both positive and negative representations for each basic event. It is proven that minimal cut sets can be obtained by a conventional method for coherent fault trees. An illustrative example of a simple event tree analysis shows the detail and characteristics of the proposed method. 相似文献
12.
《Control Engineering Practice》2009,17(10):1115-1125
The Fault Tree Handbook has become the de facto standard for fault tree analysis (FTA), defining the notation and mathematical foundation of this widely used safety analysis technique. The Handbook recognises that classical combinatorial fault trees employing only Boolean gates cannot capture the potentially critical significance of the temporal ordering of failure events in a system. Although the Handbook proposes two dynamic gates that could remedy this, a Priority-AND and an Exclusive-OR gate, these gates were never accurately defined. This paper proposes extensions to the logical foundation of fault trees that enable use of these dynamic gates in an extended and more powerful FTA. The benefits of this approach are demonstrated on a generic triple-module standby redundant system exhibiting dynamic behaviour. 相似文献
13.
Fault tree analysis with fuzzy gates 总被引:4,自引:0,他引:4
Fault tree analysis is an important tool analyzing system reliability. Fault trees consist of gates and events. Gates mean relationships between events. In fault tree analysis, AND, OR gates have been used as typical gates but it is often difficult to model the system structure with the two gates because in many cases we have not exact knowledge on system failure mechanism in early design stage. In this paper, we apply the fuzzy sets theory to modeling the fuzzy system structure, propose the new procedure to calculate the system reliability and a new importance index of basic events. 相似文献
14.
基于多值决策图的动态故障树分析方法 总被引:1,自引:0,他引:1
针对具有动态故障模式的复杂系统,动态故障树分析一直是很重要的可靠性分析技术。为了提升可靠性分析效率,已有研究提出了各种模块化方法,但是对于实际动态故障树模型中由于事件关联导致的大型动态子树,这些模块化方法的状态空间爆炸问题仍然很突出。因此介绍了一种基于多值决策图(Multiple-valued Decision Diagrams,MDD)来分析动态故障树的方法,通过多值变量编码动态门,利用单一系统MDD模型刻画各种动态和静态可靠性行为,有效地缓解了状态爆炸问题。通过一个具体的实例说明了多值决策图方法的应用和优势。 相似文献
15.
16.
Sequential mining is the process of applying data mining techniques to a sequential database for the purposes of discovering the correlation relationships that exist among an ordered list of events. An important application of sequential mining techniques is web usage mining, for mining web log accesses, where the sequences of web page accesses made by different web users over a period of time, through a server, are recorded. Web access pattern tree (WAP-tree) mining is a sequential pattern mining technique for web log access sequences, which first stores the original web access sequence database on a prefix tree, similar to the frequent pattern tree (FP-tree) for storing non-sequential data. WAP-tree algorithm then, mines the frequent sequences from the WAP-tree by recursively re-constructing intermediate trees, starting with suffix sequences and ending with prefix sequences.This paper proposes a more efficient approach for using the WAP-tree to mine frequent sequences, which totally eliminates the need to engage in numerous re-construction of intermediate WAP-trees during mining. The proposed algorithm builds the frequent header node links of the original WAP-tree in a pre-order fashion and uses the position code of each node to identify the ancestor/descendant relationships between nodes of the tree. It then, finds each frequent sequential pattern, through progressive prefix sequence search, starting with its first prefix subsequence event. Experiments show huge performance gain over the WAP-tree technique. 相似文献
17.
传统的故障树分析(Fault Tree Analysis,简称FTA)方法是一种基于静态逻辑或静态故障机理的方法,但这种方法对容错系统的可靠性分析已不适用。引入一种新的逻辑门,应用动态故障树分析技术,是解决容错系统的可靠性分析问题的一种有效途径。本文在故障树模型中引入了一种带有公用备件的热备件逻辑门,并给出了这种逻辑门转化为为马尔可夫链的方法。这种具有动态特性的逻辑门引入后所形成的动态故障树模型,扩展了传统故障树对容错系统可靠性分析的适用性。文章以某装备的电子设备系统为例,给出了用这种方法建立的动态故障树模型及其计算系统可靠度的方法和分析结果。 相似文献