Various Ways to Quantify BDMPs

A Boolean logic driven Markov process (BDMP) is a dependability analysis model that defines a continuous-time Markov chain (CTMC). This formalism has high expressive power, yet it remains readable because its graphical representation stays close to standard fault trees. The size of a BDMP is roughly...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org
Hauptverfasser:	Bouissou, Marc, Khan, Shahid, Joost-Pieter Katoen, Krcal, Pavel
Format:	Paper
Sprache:	Englisch
Veröffentlicht:	Ithaca Cornell University Library, arXiv.org 28.04.2020
Schlagworte:	Algorithms Benchmarks Boolean Boolean algebra Computer simulation Emergency power systems Fault trees Formalism Graphical representations Markov chains Monte Carlo simulation Nuclear power plants Sparse matrices
ISSN:	2331-8422
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!