Model Checking for Performability

Research output: Contribution to journalResearch articleContributedpeer-review

Contributors

Abstract

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 techniques, developed over the last decade, provides a powerful and unified method of performability evaluation, thereby combining the advantages of earlier approaches.

Details

Original languageEnglish
Pages (from-to)751-795
Number of pages45
JournalMathematical Structures in Computer Science
Volume23
Issue number4
Publication statusPublished - 2013
Peer-reviewedYes

External IDs

Scopus 84880212844
ORCID /0000-0002-5321-9343/work/142236666

Keywords

Keywords

  • Model Checking, Performability