Advances and challenges of probabilistic model checking
M Kwiatkowska, G Norman… - 2010 48th Annual Allerton …, 2010 - ieeexplore.ieee.org
Probabilistic model checking is a powerful technique for formally verifying quantitative
properties of systems that exhibit stochastic behaviour. Such systems are found in many …
properties of systems that exhibit stochastic behaviour. Such systems are found in many …
Episimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks
Preventing and controlling outbreaks of infectious diseases such as pandemic influenza is a
top public health priority. We describe EpiSimdemics-a scalable parallel algorithm to …
top public health priority. We describe EpiSimdemics-a scalable parallel algorithm to …
Probabilistic reachability for parametric Markov models
Given a parametric Markov model, we consider the problem of computing the rational
function expressing the probability of reaching a given set of states. To attack this principal …
function expressing the probability of reaching a given set of states. To attack this principal …
The how and why of interactive Markov chains
H Hermanns, JP Katoen - International Symposium on Formal Methods for …, 2009 - Springer
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of
labelled transition systems with exponentially delayed transitions. We show that IMCs are …
labelled transition systems with exponentially delayed transitions. We show that IMCs are …
Probabilistic cegar
H Hermanns, B Wachter, L Zhang - International Conference on Computer …, 2008 - Springer
Counterexample-guided abstraction refinement (CEGAR) has been en vogue for the
automatic verification of very large systems in the past years. When trying to apply CEGAR to …
automatic verification of very large systems in the past years. When trying to apply CEGAR to …
Formal verification and synthesis for discrete-time stochastic systems
M Lahijanian, SB Andersson… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Formal methods are increasingly being used for control and verification of dynamic systems
against complex specifications. In general, these methods rely on a relatively simple system …
against complex specifications. In general, these methods rely on a relatively simple system …
A game-based abstraction-refinement framework for Markov decision processes
M Kattenbelt, M Kwiatkowska, G Norman… - Formal Methods in …, 2010 - Springer
In the field of model checking, abstraction refinement has proved to be an extremely
successful methodology for combating the state-space explosion problem. However, little …
successful methodology for combating the state-space explosion problem. However, little …
Bisimulation minimisation mostly speeds up probabilistic model checking
This paper studies the effect of bisimulation minimisation in model checking of monolithic
discrete-time and continuous-time Markov chains as well as variants thereof with rewards …
discrete-time and continuous-time Markov chains as well as variants thereof with rewards …
Model-Checking ω-Regular Properties of Interval Markov Chains
We study the problem of model checking Interval-valued Discrete-time Markov Chains
(IDTMC). IDTMCs are discrete-time finite Markov Chains for which the exact transition …
(IDTMC). IDTMCs are discrete-time finite Markov Chains for which the exact transition …
Game-based abstraction for Markov decision processes
In this paper we present a novel abstraction technique for Markov decision processes
(MDPs), which are widely used for modelling systems that exhibit both probabilistic and …
(MDPs), which are widely used for modelling systems that exhibit both probabilistic and …