# Model checking for performability

@article{Baier2013ModelCF, title={Model checking for performability}, author={Christel Baier and Ernst Moritz Hahn and Boudewijn R. Haverkort and Holger Hermanns and Joost-Pieter Katoen}, journal={Mathematical Structures in Computer Science}, year={2013}, volume={23}, pages={751 - 795} }

This paper gives a bird's-eye view of the various ingredients that make up a modern, model-checking-based approach to performability evaluation: Markov reward models, temporal logics and continuous stochastic logic, model-checking algorithms, bisimulation and the handling of non-determinism. A short historical account as well as a large case study complete this picture. In this way, we show convincingly that the smart combination of performability evaluation with stochastic model-checking…

## 22 Citations

### The Probabilistic Model Checking Landscape*

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

### Fast Dynamic Fault Tree Analysis by Model Checking Techniques

- Computer ScienceIEEE Transactions on Industrial Informatics
- 2018

This paper presents a new state-space generation approach for dynamic fault trees (DFTs) that exploits several successful reduction techniques from the field of model checking. The key idea is to…

### Model Checking Meets Probability: A Gentle Introduction

- Computer ScienceEngineering Dependable Software Systems
- 2013

This paper considers fully probabilistic system models that consist of timed automata that accept timed runs iff all timing constraints resent in the automaton are met; otherwise it rejects.

### A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking

- Computer ScienceSETTA
- 2015

This paper provides the first comparative study of the performance of various BDD/MTBDD packages for this purpose, providing experimental results for several well-known probabilistic benchmarks and study the effect of several optimisations.

### Quantitative Analysis of Concurrent Reversible Computations

- Computer ScienceFORMATS
- 2015

It is proved that the equilibrium distribution of the composition of reversible automata can be derived as the product of the equilibrium distributions of each automaton in isolation.

### Observation-Enhanced QoS Analysis of Component-Based Systems

- Computer ScienceIEEE Transactions on Software Engineering
- 2020

The paper describes the theoretical foundation underlying this model refinement, the tool developed to automate it, and two case studies that apply the QoS analysis method to a service-based system implemented using public web services and to an IT support system at a large university, respectively.

### Precise Parameter Synthesis for Generalised Stochastic Petri Nets with Interval Parameters

- Computer ScienceEUROCAST
- 2017

Algorithms based on reducing the parameter synthesis problem for GSPNs to the corresponding problem for continuous-time Markov Chains (CTMCs) are developed, which can leverage existing synthesis algorithms, while retaining the modelling capabilities and expressive power of GSPN.

### Precise Parameter Synthesis for Stochastic Petri Nets with Interval Rate Parameters ?

- Computer Science
- 2017

Algorithms based on reducing the parameter synthesis problem for GSPNs to the corresponding problem for continuous-time Markov Chains (CTMCs) are developed, which can leverage existing synthesis algorithms, while retaining the modelling capabilities and expressive power of GSPN.

### Efficient synthesis of robust models for stochastic systems

- Computer ScienceJ. Syst. Softw.
- 2018

### Transient Reward Approximation for Continuous-Time Markov Chains

- Computer ScienceIEEE Transactions on Reliability
- 2015

This work uses abstraction techniques together with novel algorithms for the computation of bounds on the expected final and accumulated rewards in continuous-time Markov decision processes (CTMDPs) in the study of crowd dynamics.

## References

SHOWING 1-10 OF 92 REFERENCES

### PRISM: probabilistic model checking for performance and reliability analysis

- Computer SciencePERV
- 2009

An overview of the probabilistic model checking tool PRISM is given, focusing in particular on its support for continuous-time Markov chains and Markov reward models, and how these can be used to analyse performability properties.

### The Ins and Outs of the Probabilistic Model Checker MRMC

- Computer Science2009 Sixth International Conference on the Quantitative Evaluation of Systems
- 2009

### Performability assessment by model checking of Markov reward models

- Computer ScienceFormal Methods Syst. Des.
- 2010

Efficient procedures for model checking Markov reward models, that allow to evaluate, among others, the performability of computer-communication systems, and the logic CSRL (Continuous Stochastic Reward Logic) to specify performability measures are described.

### Principles of model checking

- Computer Science
- 2008

Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.

### Probabilistic Model Checking Modulo Theories

- Computer ScienceFourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)
- 2007

To the best of the knowledge, this is the first time that properties of probabilistic infinite-state models have been verified at this level of automation.

### Model Checking Algorithms for CTMDPs

- Computer Science, MathematicsCAV
- 2011

A new numerical approach based on uniformization is devised to compute time bounded reachability results for time dependent control strategies and experimental evidence is given showing the efficiency of the approach.

### On the use of MTBDDs for performability analysis and verification of stochastic systems

- Computer ScienceJ. Log. Algebraic Methods Program.
- 2003

### Model Checking Interactive Markov Chains

- Computer ScienceTACAS
- 2010

This paper interprets the continuous stochastic logic (CSL) over IMCs and defines the semantics of probabilistic CSL formulas with respect to the class of fully time and history dependent schedulers and shows the applicability of this approach.

### Approximate Symbolic Model Checking of Continuous-Time Markov Chains

- Mathematics, Computer ScienceCONCUR
- 1999

A symbolic approximate method for solving the integrals using MTDDs (multi-terminal decision diagrams), a generalisation of MTBDDs, suitable for numerical integration using quadrature formulas based on equally-spaced abscissas, like trapezoidal, Simpson and Romberg integration schemes.