An Algebraic Binary Decision Diagram for Analysis of Dynamic Fault Tree

Jiang, Wei; Zhou, Shaoying; Ye, Luyao; Zhao, Dongdong; Tian, Jing; Wong, William G.; Xiang, Jianwen

doi:10.1109/dsa.2018.00018

Cited by 6 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the application of SBDD had some restrictions on the requirements of dynamic gate and DFT. Based on the study of Merle 65 about the dynamic gate of algebraic model and determining the structure function of any DFT, Jiang 66 proposed ABDD, which broadened the scope of application, and reduced the computational complexity by making new rules to reduce SDP.…”

Section: The Realization Methods Of Dftmentioning

confidence: 99%

A review on the realization methods of dynamic fault tree

Zhu

Zhang

2022

Quality & Reliability Eng

View full text Add to dashboard Cite

Dynamic fault tree (DFT) is an extended technology of Fault tree analysis (FTA). It has been widely used in many fields and plays an important role in improving the security performance of the system. Although DFT has developed for many years, new research in recent years is still worthy of attention. In this study, the research status of different realization methods/analysis techniques of DFT is comprehensively reviewed. First, the development and research trend of DFT are described. Second, the research on dynamic gates and components in the analysis techniques is introduced in detail. Third, the mainstream realization methods of DFT, such as Markov chain, Bayesian network (BN) and so on, are summarized. At the same time, the application of other auxiliary analysis techniques is also introduced. Then, based on the research progress of different realization methods, the future development direction and challenges of DFT are prospected. The realization methods of DFT not only need the rigorous theoretical foundation. Moreover, it is also necessary to consider the combination of real‐time data and system modeling technology to realize dynamic assessment and smart system in the future.

show abstract

Section: The Realization Methods Of Dftmentioning

confidence: 99%

A review on the realization methods of dynamic fault tree

Zhu

Zhang

2022

Quality & Reliability Eng

View full text Add to dashboard Cite

show abstract

“…An improved SBDD-based method was proposed to analyze the reliability of a DFT with the arbitrary tree structure in [21]. In [22], an algebraic binary decision diagram (ABDD) was proposed to do the reliability analysis of the DFT by introducing algebraic structure functions. An improved method based on component connection was proposed to construct SBDD encoding a DFT in [23].…”

Section: Related Workmentioning

confidence: 99%

Reliability Analysis of Cold-standby Systems with Subsystems Using Conditional Binary Decision Diagrams

Zhou¹,

Yu²

2023

Journal of Internet Technology

View full text Add to dashboard Cite

<p>Cold-standby systems have been widely used for conditions with limited power, which achieve fault tolerance and high-reliability systems. The cold spare (CSP) gate is a common dynamic gate in the dynamic fault tree (DFT). DFT with CSP gates is typically used to model a cold-standby system for reliability analysis. In general, inputs of the CSP gate are considered to be basic events. However, with the requirement of the current system design, the inputs of the CSP gate may be either basic events or top events of subtrees. Hence, the sequence-dependency among basic events in CSP gates becomes much more complex. However, the early conditional binary decision diagram (CBDD) used for the reliability analysis of spare gates does not consider it well. To address this problem, the conditioning event rep is improved to describe the replacement behavior in CSP gates with subtrees inputs, and the related formulae are derived. Further, a combinatorial method based on the CBDD is demonstrated to evaluate the reliability of cold-standby systems modeled by CSP gates with subtrees inputs. The case study is presented to show the advantage of using our method.</p> <p> </p>

show abstract

“…Temporal relations in DFTs are typically expressed by other means than SANDnodes. The poset semantics of DFTs are studied via extended binary decision diagrams in [18].…”

Section: Related Workmentioning

confidence: 99%

Attack time analysis in dynamic attack trees via integer linear programming

Lopuhaä-Zwakenberg¹,

Stoelinga²

2021

Preprint

View full text Add to dashboard Cite

Attack trees are an important tool in security analysis, and an important part of attack tree analysis is computing metrics. This paper focuses on dynamic attack trees and their min time metric. For general attack trees, calculating min time efficiently is an open problem, with the fastest current method being enumerating all minimal attacks, which is NP-hard. This paper introduces 3 new tools for calculating min time. First, we show that static attack trees can be handled by a fast bottom-up algorithm. Second, we introduce a novel method for general dynamic attack trees based on mixed integer linear programming. Third, we show how the computation can be sped up by identifying the modules of an attack tree, i.e. subtrees connected to the rest of the attack tree via only one node. Experiments on a generated testing set of large attack trees verify that these methods have a large impact on performance.

show abstract

An Algebraic Binary Decision Diagram for Analysis of Dynamic Fault Tree

Cited by 6 publications

References 18 publications

A review on the realization methods of dynamic fault tree

A review on the realization methods of dynamic fault tree

Reliability Analysis of Cold-standby Systems with Subsystems Using Conditional Binary Decision Diagrams

Attack time analysis in dynamic attack trees via integer linear programming

Contact Info

Product

Resources

About