Effective static and dynamic fault tree analysis.
| Authors | |
|---|---|
| Year of publication | 2016 |
| Type | Article in Proceedings |
| Conference | In International Conference on Computer Safety, Reliability, and Security |
| MU Faculty or unit | |
| Citation | |
| Doi | http://dx.doi.org/10.1007/978-3-319-45477-1_21 |
| Field | Informatics |
| Keywords | static and dynamic fault trees; PSA; nuclear safety; interactive Markov chains; open IMC |
| Description | Fault trees constitute one of the essential formalisms for static safety analysis of various industrial systems. Dynamic fault trees (DFT) enrich the formalism by support for time-dependent behaviour, e.g., repairs or dynamic dependencies. This enables more realistic and more precise modelling, and can thereby avoid overly pessimistic analysis results. But analysis of DFT is so far limited to substantially smaller models than those required for instance in the domain of nuclear power safety. This paper considers so called SD fault trees, where the user is free to express each equipment failure either statically, without modelling temporal information, or dynamically, allowing repairs and other timed interdependencies. We introduce an analysis algorithm for an important subclass of SD fault trees. The algorithm employs automatic abstraction techniques effectively, and thereby scales similarly to static analysis algorithms, albeit allowing for a more realistic modelling and analysis. We demonstrate the applicability of the method by an experimental evaluation on fault trees of nuclear power plants. |
| Related projects: |