A Stochastic Approach for the Analysis of Dynamic Fault Trees With Spare Gates Under Probabilistic Common Cause Failures


A redundant system typically consists of primary and standby modules. The therefore-referred to as spare gate is extensively used to model the dynamic behavior of redundant systems in the applying of dynamic fault trees (DFTs). Many methodologies have been proposed to judge the reliability of DFTs containing spare gates by computing the failure likelihood. However, either a complicated analysis or vital simulation time are sometimes needed by such an approach. Moreover, it's difficult to compute the failure chance of a system with part failures that are not exponentially distributed. Additionally, probabilistic common cause failures (PCCFs) have been widely reported, sometimes occurring during a statistically dependent manner. Failure to account for the result of PCCFs overestimates the reliability of a DFT. In this paper, stochastic computational models are proposed for an economical analysis of spare gates and PCCFs in a very DFT. Using these models, a DFT with spare gates under PCCFs will be efficiently evaluated. In the proposed stochastic approach, a symbol likelihood is encoded as a non-Bernoulli sequence of random permutations of mounted numbers of ones and zeros. The component's failure chance isn't limited to an exponential distribution, thus this approach is applicable to a DFT analysis in an exceedingly general case. Several case studies are evaluated to point out the accuracy and efficiency of the proposed approach, compared to both an analytical approach and Monte Carlo (MC) simulation.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Link Prediction Based on Stochastic Information Diffusion ABSTRACT: Link prediction (LP) in networks aims to determine future interactions among elements; it is an essential piece of machine learning software in
PROJECT TITLE : Dynamic Scheduling for Stochastic Edge-Cloud Computing Environments using A3C learning and Residual Recurrent Neural Networks ABSTRACT: The widespread adoption of applications that are based on the Internet
PROJECT TITLE : An Analysis of a Stochastic ON-OFF Queueing Mobility Model for Software-Defined Vehicle Networks ABSTRACT: Recently, we have been exposed to a number of newly developed software-defined paradigms of VANET in
PROJECT TITLE : A Stochastic Approach to Finding Densest Temporal Subgraphs in Dynamic Graphs ABSTRACT: Finding the densest lasting -subgraphs in large dynamic graphs, which takes into consideration the time duration of the
PROJECT TITLE : Attention in Reasoning Dataset, Analysis, and Modeling ABSTRACT: Although attention has become an increasingly popular component in deep neural networks for the purpose of both interpreting data and improving

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry