The probabilistic model checking landscape
JP Katoen - Proceedings of the 31st Annual ACM/IEEE Symposium …, 2016 - dl.acm.org
Randomization is a key element in sequential and distributed computing. Reasoning about
randomized algorithms is highly non-trivial. In the 1980s, this initiated first proof methods …
randomized algorithms is highly non-trivial. In the 1980s, this initiated first proof methods …
On time with minimal expected cost!
Abstract (Priced) timed games are two-player quantitative games involving an environment
assumed to be completely antogonistic. Classical analysis consists in the synthesis of …
assumed to be completely antogonistic. Classical analysis consists in the synthesis of …
The 10,000 facets of MDP model checking
This paper presents a retrospective view on probabilistic model checking. We focus on
Markov decision processes (MDPs, for short). We survey the basic ingredients of MDP …
Markov decision processes (MDPs, for short). We survey the basic ingredients of MDP …
Analysis of timed and long-run objectives for Markov automata
D Guck, H Hatefi, H Hermanns… - Logical Methods in …, 2014 - lmcs.episciences.org
Markov automata (MAs) extend labelled transition systems with random delays and
probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution …
probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution …
[HTML][HTML] Efficient approximation of optimal control for continuous-time Markov games
We study the time-bounded reachability problem for continuous-time Markov decision
processes (CTMDPs) and games (CTMGs). Existing techniques for this problem use …
processes (CTMDPs) and games (CTMGs). Existing techniques for this problem use …
Cost vs. time in stochastic games and Markov automata
H Hatefi, B Braitling, R Wimmer, LMF Fioriti… - … : Theories, Tools, and …, 2015 - Springer
Costs and rewards are important tools for analysing quantitative aspects of models like
energy consumption and costs of maintenance and repair. Under the assumption of …
energy consumption and costs of maintenance and repair. Under the assumption of …
Finite horizon analysis of Markov automata
H Hatefi Ardakani - 2016 - publikationen.sulb.uni-saarland.de
Markov automata constitute an expressive continuous-time compositional modelling
formalism, featuring stochastic timing and nondeterministic as well as probabilistic …
formalism, featuring stochastic timing and nondeterministic as well as probabilistic …
[PDF][PDF] Verifying probabilistic systems: new algorithms and complexity results
H Fu - 2014 - publications.rwth-aachen.de
The content of the dissertation falls in the area of formal verification of probabilistic systems.
It comprises four parts listed below: 1. the decision problem of (probabilistic) simulation …
It comprises four parts listed below: 1. the decision problem of (probabilistic) simulation …
Cost vs. time in stochastic games and Markov automata
H Hatefi, R Wimmer, B Braitling, LMF Fioriti… - Formal Aspects of …, 2017 - Springer
Costs and rewards are important tools for analysing quantitative aspects of models like
energy consumption and costs of maintenance and repair. Under the assumption of …
energy consumption and costs of maintenance and repair. Under the assumption of …
Reliable systems: fault tree analysis via Markov reward automata
D Guck - 2017 - research.utwente.nl
Today's society is characterised by the ubiquitousness of hardware and software systems on
which we rely on day in, day out. They reach from transportation systems like cars, trains and …
which we rely on day in, day out. They reach from transportation systems like cars, trains and …