Results 251 to 260 of about 151,158 (307)
Some of the next articles are maybe not open access.

Dynamic Fault Tolerance in Fat Trees

IEEE Transactions on Computers, 2011
Fat trees are a very common communication architecture in current large-scale parallel computers. The probability of failure in these systems increases with the number of components. We present a routing method for deterministically and adaptively routed fat trees, applicable to both distributed and source routing, that is able to handle several ...
Frank Olaf Sem-Jacobsen   +2 more
exaly   +2 more sources

Scalable Analysis of Fault Trees with Dynamic Features

2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2015
Fault trees constitute one of the essential formalisms for static safety analysis of various industrial systems. Dynamic fault trees (DFT) enrich the formalism by time-dependent behavior, e.g., repairs or functional dependencies. Analysis of DFT is so far limited to substantially smaller models than those required for, e.g., nuclear power plants.
Jan Krčál, Pavel Krčál
exaly   +2 more sources

Dynamic Reliability Block Diagrams VS Dynamic Fault Trees

open access: yes2007 Proceedings - Annual Reliability and Maintainability Sympsoium, 2007
Reliability block diagrams (RBD), and fault trees (FT) are the most widely used formalisms in system reliability modeling. They implement two different approaches: in a reliability block diagram, the system is represented by components connected according to their function or reliability relationships, while fault trees show which combinations of the ...
DISTEFANO, SALVATORE, PULIAFITO, Antonio
core   +4 more sources

A Static Analysis of Dynamic Fault Trees with Priority-AND Gates

2013 Sixth Latin-American Symposium on Dependable Computing, 2013
A PAND gate is a special AND gate of Dynamic Fault Trees (DFTs) where the input events must occur in a specific order for the occurrence of its output event. We present a transformation from a PAND gate to an AND gate with some dependent conditioning events, called CAND gate, provided that the dynamic behavior of the system can be modeled by a (semi ...
Jianwen Xiang   +5 more
semanticscholar   +2 more sources

Formal Verification of Rewriting Rules for Dynamic Fault Trees

open access: yes, 2019
Dynamic Fault Trees (DFTs) model the failure behavior of systems dynamics. Several rewriting rules have been recently developed, which allow the simplification of DFTs prior to a formal analysis with tools such as the Storm model checker. To ascertain the soundness of the analysis, we propose to formally verify these rewriting rules using higher-order ...
Yassmeen Elderhalli   +4 more
openaire   +2 more sources

A Numerical Analysis of Dynamic Fault Trees Based on Stochastic Bounds

International Conference on Quantitative Evaluation of Systems, 2015
We present a numerical method based on stochastic bounds and computations of discrete distributions to get the transient reliability of a system described by a Dynamic Fault Tree. We show that the gates of the tree are associated to simple operators on the probability distributions of the time to failure.
J. Fourneau, N. Pekergin
semanticscholar   +3 more sources

Formal Dynamic Fault Trees Analysis Using an Integration of Theorem Proving and Model Checking

Lecture Notes in Computer Science, 2018
Yassmeen Elderhalli   +2 more
exaly   +2 more sources

Analytical Calculation and Rapid Simulation of Survival Signatures in Dynamic Fault Trees With Priority-AND Gates

IEEE Transactions on Reliability, 2023
Many practical systems are often involved in sequence-dependent failure behaviors. The efficiency of analyzing these dynamic systems is limited by addressing sequential failure events (SFEs).
Shaoxuan Wang   +5 more
semanticscholar   +1 more source

The Conversion of Dynamic Fault Trees to Stochastic Petri Nets, as a case of Graph Transformation

open access: yesElectronic Notes in Theoretical Computer Science, 2005
A model-to-model transformation from Dynamic Fault Trees to Stochastic Petri Nets, by means of graph transformation rules, is presented in this paper.
Daniele Codetta-Raiteri
exaly   +2 more sources

Home - About - Disclaimer - Privacy