scispace - formally typeset
Proceedings ArticleDOI

Reliability Analysis of a Computer-Based Interlocking System with a Double 2-out-of-2 Redundancy Structure using Algebraic Binary Decision Diagrams

Wenjia Long, +1 more
- pp 447-453
Reads0
Chats0
TLDR
In this article , a reliability analysis of the computer-based interlocking (CBI) system of urban rail is presented by using the algebraic binary decision diagram (ABDD) based method.
Abstract
The computer-based interlocking (CBI) system of urban rail is a safe-critical system. To keep the high reliability of the CBI system of urban rail, reliability analysis is very necessary and important work. The double 2-out-of-2 redun-dancy structure has been widely used in the CBI system which is a core part of control signal equipment in urban rail. The dynamic fault tree (DFT) is an extension of the static fault tree (SFT), which is widely used for the reliability modeling of dynamic systems. An algebraic binary decision diagram (ABDD) is an extension of a binary decision diagram (BDD) which introduces a kind of node denoting a sequence-dependency between events. The DFT can be evaluated by the ABDD. This paper firstly presents a reliability analysis of the CBI system in urban rail by using the ABDD-based method. The CBI system is modeled by the DFT, then the DFT is converted into a function based on a temporal algebraic framework. According to the temporal function, the ABDD can be built for reliability analysis. Compared to the Markov-based method, the ABDD-based method can avoid space-state explosion and have no limitation on the exponential distribution of component failure. A case study related to the CBI system is presented to show the advantage of using our method.

read more

Content maybe subject to copyright    Report

References
More filters
Journal ArticleDOI

Dynamic fault-tree models for fault-tolerant computer systems

TL;DR: HARP (Hybrid Automated Reliability Predictor) is a software package developed at Duke University and NASA Langley Research Center that can solve fault-tree models that frequently employ high levels of redundancy, dynamic redundancy management, and complex fault and error recovery techniques.
Journal ArticleDOI

New algorithms for fault trees analysis

TL;DR: A new method is presented that allows the efficient computation of both the minimal cuts of a fault tree and the probability of its root event and results in a qualitative and quantitative improvement in safety analysis of industrial systems.
Journal ArticleDOI

Probabilistic Algebraic Analysis of Fault Trees With Priority Dynamic Gates and Repeated Events

TL;DR: This paper focuses on a sub-class of Dynamic Fault trees, called Priority Dynamic Fault Trees (PDFTs), containing only static gates, and Priority Dynamic Gates (Priority-AND, and Functional Dependency) for which a priority relation among the input nodes completely determines the output behavior.
Journal ArticleDOI

Reliability Analysis of Nonrepairable Cold-Standby Systems Using Sequential Binary Decision Diagrams

TL;DR: This paper proposes an analytical method based on sequential binary decision diagrams (SBDD) for combinatorial reliability analysis of nonrepairable cold-standby systems that can generate exact system reliability results.
Journal ArticleDOI

Algebraic determination of the structure function of Dynamic Fault Trees

TL;DR: This paper presents an algebraic framework allowing to algebraically model dynamic gates and determine the structure function of any Dynamic Fault Tree (DFT), which can then be exploited to perform both the qualitative and quantitative analysis of DFTs directly.