排序方式: 共有5条查询结果,搜索用时 0 毫秒
1
1.
零压缩二元判定树ZBDD(Zero-suppressed Binary Decision Diagrams)作为一种近年来兴起的存储布尔多项式的数据结构能更有效地平衡内存消耗与计算速度;基于它的布尔多项武Gr(O)bner基算法可以在运算中保持ZBDD结构的不变性从而进一步提高计算效率.用C++实现了布尔多项式的Gr(... 相似文献
2.
With the advent of the Binary Decision Diagrams (BDD) approach in fault tree analysis, a significant enhancement has been achieved with respect to previous approaches, both in terms of efficiency and accuracy of the overall outcome of the analysis. However, the exponential increase of the number of nodes with the complexity of the fault tree may prevent the construction of the BDD. In these cases, the only way to complete the analysis is to reduce the complexity of the BDD by applying the truncation technique, which nevertheless implies the problem of estimating the truncation error or upper and lower bounds of the top-event unavailability.This paper describes a new method to analyze large coherent fault trees which can be advantageously applied when the working memory is not sufficient to construct the BDD. It is based on the decomposition of the fault tree into simpler disjoint fault trees containing a lower number of variables. The analysis of each simple fault tree is performed by using all the computational resources. The results from the analysis of all simpler fault trees are re-combined to obtain the results for the original fault tree.Two decomposition methods are herewith described: the first aims at determining the minimal cut sets (MCS) and the upper and lower bounds of the top-event unavailability; the second can be applied to determine the exact value of the top-event unavailability. Potentialities, limitations and possible variations of these methods will be discussed with reference to the results of their application to some complex fault trees. 相似文献
3.
4.
为了提高C919飞机起落架的维修的效率,设计了故障测试仪器,测试仪的软件部分将根据系统结构绘制故障树,首先优化为ZBDD数据结构,接着测试仪器调用Fussell算法下行展开推理故障事件的最小割集,软件前端与后端SQL Server 2008数据库连接,利用故障事件关键词匹配检索,输出相关历史故障案例报表,推荐报表信息与故障案例匹配度可以达到65%以上.使用实际效果证明该测试设备能根据硬件信号故障,较准确地推理故障原因,并提供有价值的处理经验作为参考. 相似文献
5.
Zero-suppressed BDDs and their applications 总被引:2,自引:0,他引:2
Shin-ichi Minato 《International Journal on Software Tools for Technology Transfer (STTT)》2001,3(2):156-170
In many real-life problems, we are often faced with manipulating sets of combinations. In this article, we study a special
type of ordered binary decision diagram (OBDD), called zero-suppressed BDDs (ZBDDs). This data structure represents sets of
combinations more efficiently than using original OBDDs. We discuss the basic data structures and algorithms for manipulating
ZBDDs in contrast with the original OBDDs. We also present some practical applications of ZBDDs, such as solving combinatorial
problems with unate cube set algebra, logic synthesis methods, Petri net processing, etc. We show that a ZBDD is a useful
option in OBDD techniques, suitable for a part of the practical applications.
Published online: 15 May 2001 相似文献
1