# Various Ways to Quantify BDMPs

@article{Bouissou2020VariousWT, title={Various Ways to Quantify BDMPs}, author={M. Bouissou and Shahid Khan and J. Katoen and P. Krc{\'a}l}, journal={ArXiv}, year={2020}, volume={abs/2004.13283}, pages={1-14} }

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 speaking proportional to the size of the system it models, whereas the size of the CTMC specified by this BDMP suffers from exponential growth. Thus quantifying large BDMPs can be a challenging task… Expand

#### One Citation

Explaining Boolean-Logic Driven Markov Processes using GSPNs

- Computer Science
- 2020 16th European Dependable Computing Conference (EDCC)
- 2020

A formal semantics of repairable BDMPs is presented by using generalized stochastic Petri nets (GSPNs) and is modular and thus easily extendable to other elements, e.g., leaves dedicated to security applications. Expand

#### References

SHOWING 1-10 OF 30 REFERENCES

A new formalism that combines advantages of fault-trees and Markov models: Boolean logic driven Markov processes

- Computer Science
- Reliab. Eng. Syst. Saf.
- 2003

A modeling formalism that enables the analyst to combine concepts inherited from fault trees and Markov models in a new way, Boolean logic Driven Markov Processes (BDMP), which allows the definition of complex dynamic models while remaining nearly as readable and easy to build as fault-trees. Expand

Synergizing Reliability Modeling Languages: BDMPs without Repairs and DFTs

- Computer Science
- 2019 IEEE 24th Pacific Rim International Symposium on Dependable Computing (PRDC)
- 2019

This paper outlines a set of BDMP-to-DFT translation rules and applies them to thirty-three BDMP test cases modeling various scenarios of security, software and system reliability and compares the performance and capabilities of analysis tools for BDMPs. Expand

A path-based algorithm to evaluate asymptotic unavailability for large Markov models

- Computer Science
- Annual Reliability and Maintainability Symposium. 2002 Proceedings (Cat. No.02CH37318)
- 2002

This paper proposes a method exploiting this path-based approach to evaluate the asymptotic unavailability of a system which is completely and quickly repairable, and shows on a simple example that the more reliable the system, the better the approximation given by the method. Expand

The Probabilistic Model Checker Storm

- Computer Science
- ArXiv
- 2020

The main features of Storm are reported and how to effectively use them are explained and an empirical evaluation of different configurations of Storm on the QComp 2019 benchmark set is presented. Expand

Path probability evaluation with repeated rates

- Mathematics
- Annual Reliability and Maintainability Symposium
- 1997

In this paper we present a method for handling big Markovian graphs for reliability studies. If the model is Markovian, it is theoretically possible to generate and quantify the state graph. However,… Expand

The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models - (QComp 2019 Competition Report)

- Computer Science
- TACAS
- 2019

The challenges in setting up a quantitative verification competition are reported, the results of QComp 2019 are presented, the lessons learned are summarised, and an outlook on the features of the next edition ofQComp is provided. Expand

The Probabilistic Model Checking Landscape*

- Computer Science
- 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- 2016

This paper surveys the algorithmic verification of probabilistic models, in particular Probabilistic model checking, and provides an informal account of the main models, the underlying algorithms, applications from reliability and dependability analysis—and beyond—and describes recent developments towards automated parameter synthesis. Expand

JANI: Quantitative Model and Tool Interaction

- Computer Science
- TACAS
- 2017

The Jani model format and tool interaction protocol is a metamodel based on networks of communicating automata and has been designed for ease of implementation without sacrificing readability, to provide a stable and uniform interface between tools such as model checkers, transformers, and user interfaces. Expand

An algorithm in order to implement reliability exponential approximations

- Mathematics
- 1994

Abstract Calculation of the reliability of large repairable systems is discussed here. We first present the background: a rule-based model and exponential approximations. The rule-based model allows… Expand

Knowledge Modelling and Reliability Processing: Presentation of the Figaro Language and Associated Tools

- Computer Science
- 1991

The main ideas which determined the FIGARO language are presented, and general ideas by examples are illustrated by examples. Expand