Fault tree analysis: A survey of the state-of-the-art in modeling, analysis and tools

Ruijters, Enno Jozef Johannes; Stoelinga, Mariëlle

doi:10.1016/j.cosrev.2015.03.001

Cited by 605 publications

(444 citation statements)

References 142 publications

(198 reference statements)

Supporting

Mentioning

438

Contrasting

Unclassified

Order By: Relevance

“…As an instance with a more complex dependency structure we then consider a network model where nodes are organized in a full binary tree. Such dependency structure arises commonly in fault tree analysis [17]. We also consider an instance with a grid structure, as an abstraction of device networks such as sensor and communication grids [9].…”

Section: Experimental Evaluationmentioning

confidence: 99%

Symbolic Model Checking for Factored Probabilistic Models

Deininger

Dimitrova

Majumdar

2016

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. The long line of research in probabilistic model checking has resulted in efficient symbolic verification engines. Nevertheless, scalability is still a key concern. In this paper we ask two questions. First, can we lift, to the probabilistic world, successful hardware verification techniques that exploit local variable dependencies in the analyzed model? And second, will those techniques lead to significant performance improvement on models with such structure, such as dynamic Bayesian networks? To the first question we give a positive answer by proposing a probabilistic model checking approach based on factored symbolic representation of the transition probability matrix of the analyzed model. Our experimental evaluation on several benchmarks designed to favour this approach answers the second question negatively. Intuitively, the reason is that the effect of techniques for reducing the size of BDD-based symbolic representations do not carry over to quantitative symbolic data structures. More precisely, the size of MTBDDs depends not only on the number of variables but also on the number of different terminals they have (which influences sharing), and which is not reduced by these techniques.

show abstract

Section: Experimental Evaluationmentioning

confidence: 99%

Symbolic Model Checking for Factored Probabilistic Models

Deininger

Dimitrova

Majumdar

2016

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

show abstract

“…It uses graphical depiction of events and relationship as well as top down method for studying causes of hazards in a system via a tree-like structure and Boolean logic for its construction [39]. A fault tree with a voting gate and the Reliability Block Diagram (RBD) equivalent is presented in Figure 5.…”

Section: Gta Risk Management Modelsmentioning

confidence: 99%

A review of game theory approach to cyber security risk management

Akinwumi¹,

Babatunde²,

Alese³

et al. 2018

Nig. J. Tech.

View full text Add to dashboard Cite

Cyber security is among the most complex and rapidly evolving issues and has been the focus of present day organizations. Cyber security risk management is the process of managing or reducing potentially harmful and uncertain events that posse as threats to cyber security. It involves looking at what could go wrong on the cyber space and deciding on ways to prevent or minimize their occurrences or effects. One of the prominent cyber security risk management techniques is the Game Theoretic Approach (GTA), which focuses on the use of resources, internal controls, information sharing, technical improvements, behavioral or organizational scale-ups and cyber insurance for cyber risk management. This paper presents a review of game theoretic-based model for cyber security risk management. Specifically, issues on modeling, some related works and significance of game theoretic approach to cyber security risk management are presented. Findings from the review revealed the peculiarities and specificity of each model. It is also revealed that the models are just evolving and require much improvement.

show abstract

“…The analysis methods include Algebraic, Markov Chain, Petri Nets, Bayesian network, Monte Carlo simulation [159]. To analyze the impacts of the cyber layer of composite power systems; a multi-state Markov chain model is built; non-sequential Monte-Carlo simulation is applied to evaluate the reliability and availability [210].…”

Section: The Formal Vandv For Dependable Self-managing Cpsmentioning

confidence: 99%

“…The traditional dependability V&V methods are surveyed in [155][156][157][158][159][160][161][162]. These methods include Fault Tree Analysis (FTA) e. Another useful method to improve the dependability is the fault injection.…”

Section: The Traditional Dependability Means and Vandvmentioning

confidence: 99%

“…As a well-established and well-understood technique, FTA has various extensions for analyzing dynamic behaviors such as Dynamic Fault Tree (DFT) [159][160] for capturing the sequence dependent dynamic behavior with functional dependency gate and SPARE gate; Temporal Fault Trees (TFT) [159][160] for modeling temporal requirements with temporal logic and Pandora TFT [160,198]; Component fault trees (CFT) [159][160] for managing the complexity of modern systems by hierarchical decomposition of systems, and Hybrid Fault Tree Automaton [199]; Repairable Fault Trees [159] for analyzing the effect of repair policies, State event fault trees [160], etc. Petri net is another popular formal method for CPS V&V. The Definition and an object-oriented Petri nets formal modeling approach is proposed for High-Confidence CPS [200].…”

Section: The Formal Vandv For Dependable Self-managing Cpsmentioning

confidence: 99%

See 1 more Smart Citation

A Comprehensive Technological Survey on Dependable Self-Managing CPS: The Decade of Researches on Correctness and Dependability

Zhou¹,

Hou²,

Zhang³

et al. 2017

Preprint

View full text Add to dashboard Cite

Though Cyber Physical Systems (CPS) become very popular in last the decade, dependability of CPS is still a critical issue and related survey is rare. We try to spell out the jigsaw of technologies and figure out the technical trends of dependable self-managing CPS. This survey first recalls the motivation and the similar concepts. By analyzing four generic architectures, we summarize the common characteristics and related assurance technologies, and propose a more generic environment-in-loop processing flow of CPS and a formal interaction flow between physical space and cyber space. Further, the similarity between correctness and dependability is formally analyzed and the new five research questions of dependable self-managing CPS are presented. Then we review the critical technologies and related correctness verification & validation (V&V) methods, the architectures for dependable self-managing CPS. Further, the detail dependability management and V&V technologies are surveyed, which covers the areas of running-time fault management methods and whole life cycle V&V technologies, maintenance and available tool sets. For holistic CPS development, Modeling techniques and MDE (model driven engineering) based V&V methods are analyzed in detail. Then we complete the jigsaw of technologies and figure out the missing part. Further, we propose the technical challenges and the further direction. To our best knowledge, this is the first comprehensive survey on dependable self-managing CPS development and evaluation.

show abstract

Fault tree analysis: A survey of the state-of-the-art in modeling, analysis and tools

Cited by 605 publications

References 142 publications

Symbolic Model Checking for Factored Probabilistic Models

Symbolic Model Checking for Factored Probabilistic Models

A review of game theory approach to cyber security risk management

A Comprehensive Technological Survey on Dependable Self-Managing CPS: The Decade of Researches on Correctness and Dependability

Contact Info

Product

Resources

About