Fault Tree Reliability Analysis via Squarefree Polynomials

Milan Lopuhaä-Zwakenberg

2024

Abstract

Fault tree (FT) analysis is a prominent risk assessment method in industrial systems. Unreliability is one of the key safety metrics in quantitative FT analysis. Existing algorithms for unreliability analysis are based on binary decision diagrams, for which it is hard to give time complexity guarantees beyond a worst-case exponential bound. In this paper, we present a novel method to calculate FT unreliability based on algebras of squarefree polynomials and prove its validity. We furthermore prove that time complexity is low when the number of multiparent nodes is limited. Experiments show that our method is competitive with the state-of-the-art and outperforms it for FTs with few multiparent nodes.

Paper Citation

in Harvard Style

Lopuhaä-Zwakenberg M. (2024). Fault Tree Reliability Analysis via Squarefree Polynomials. In Proceedings of the 12th International Conference on Model-Based Software and Systems Engineering - Volume 1: MODELSWARD; ISBN 978-989-758-682-8, SciTePress, pages 39-49. DOI: 10.5220/0012334000003645

in Bibtex Style

@conference{modelsward24,
author={Milan Lopuhaä-Zwakenberg},
title={Fault Tree Reliability Analysis via Squarefree Polynomials},
booktitle={Proceedings of the 12th International Conference on Model-Based Software and Systems Engineering - Volume 1: MODELSWARD},
year={2024},
pages={39-49},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012334000003645},
isbn={978-989-758-682-8},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 12th International Conference on Model-Based Software and Systems Engineering - Volume 1: MODELSWARD
TI - Fault Tree Reliability Analysis via Squarefree Polynomials
SN - 978-989-758-682-8
AU - Lopuhaä-Zwakenberg M.
PY - 2024
SP - 39
EP - 49
DO - 10.5220/0012334000003645
PB - SciTePress