1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.LO2016★ 1 cited
Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games
Ernst Moritz Hahn, Sven Schewe, Andrea Turrini +1
2.5 player parity games combine the challenges posed by 2.5 player reachability games and the qualitative analysis of parity games. These two types of problems are best approached…
cs.LO2016
Efficient Algorithms for Time- and Cost-Bounded Probabilistic Model Checking
Ernst Moritz Hahn, Arnd Hartmanns
In the design of probabilistic timed systems, bounded requirements concerning behaviour that occurs within a given time, energy, or more generally cost budget are of central import…
cs.LO2016
An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties
Yong Li, Wanwei Liu, Andrea Turrini +2
In this paper, we propose an efficient algorithm for the parameter synthesis of PLTL formulas with respect to parametric Markov chains. The PLTL formula is translated to an almost…