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...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Bouissou, Marc, Khan, Shahid, Joost-Pieter Katoen, Krcal, Pavel
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 28.04.2020
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!