Monte Carlo simulation is a common technique to estimate dependability metrics for fault trees. A bottleneck in this technique is the number of samples needed, especially when the interesting events are rare and occur with low probability. Rare Event Simulation () reduces the number of samples when analysing rare events. Importance splitting is a method that spawns more simulation runs from promising system states. How promising a state is, is indicated by an importance function, which concentrates the information that makes this method efficient. Importance functions are given by domain and experts. This hinders re-utilisation and involves decisions entailing potential human error. Focusing in (general) fault trees, in this paper we automatically derive importance functions based on the tree structure. For this we exploit a common fault tree concept, namely cut sets: the more elements from a cut set have failed, the higher the importance. We show that the cut-set-derived importance function is an easy-to-implement and simple concept, that can nonetheless compete against another (more involved) automatic importance function for.
Automated Rare Event Simulation for Fault Tree Analysis via Minimal Cut Sets / Budde, Carlos E.; Stoelinga, Mariëlle. - ELETTRONICO. - 12040:(2020), pp. 259-277. (Intervento presentato al convegno 20th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems, MMB 2020 tenutosi a Saarbrücken, Germany nel 16–18 March, 2020) [10.1007/978-3-030-43024-5_16].
Automated Rare Event Simulation for Fault Tree Analysis via Minimal Cut Sets
Carlos E. Budde;
2020-01-01
Abstract
Monte Carlo simulation is a common technique to estimate dependability metrics for fault trees. A bottleneck in this technique is the number of samples needed, especially when the interesting events are rare and occur with low probability. Rare Event Simulation () reduces the number of samples when analysing rare events. Importance splitting is a method that spawns more simulation runs from promising system states. How promising a state is, is indicated by an importance function, which concentrates the information that makes this method efficient. Importance functions are given by domain and experts. This hinders re-utilisation and involves decisions entailing potential human error. Focusing in (general) fault trees, in this paper we automatically derive importance functions based on the tree structure. For this we exploit a common fault tree concept, namely cut sets: the more elements from a cut set have failed, the higher the importance. We show that the cut-set-derived importance function is an easy-to-implement and simple concept, that can nonetheless compete against another (more involved) automatic importance function for.File | Dimensione | Formato | |
---|---|---|---|
paper_camera_ready.pdf
accesso aperto
Descrizione: Article camera-ready
Tipologia:
Post-print referato (Refereed author’s manuscript)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
976.4 kB
Formato
Adobe PDF
|
976.4 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione