3 citations · 10 across the 5 of their papers we have counts for
5 papers
Multiple Mean-Payoff Optimization under Local Stability Constraints
David Klaška, Antonín Kučera, Vojtěch Kůr +2
The long-run average payoff per transition (mean payoff) is the main tool for specifying the performance and dependability properties of discrete systems. The problem of constructi…
Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes
David Klaška, Antonín Kučera, Vojtěch Kůr +2
Long-run average optimization problems for Markov decision processes (MDPs) require constructing policies with optimal steady-state behavior, i.e., optimal limit frequency of visit…
Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games
David Klaška, Antonín Kučera, Vít Musil +1
We design a new efficient strategy synthesis method applicable to adversarial patrolling problems on graphs with arbitrary-length edges and possibly imperfect intrusion detection.…
Fast Computation of Strong Control Dependencies
Marek Chalupa, David Klaška, Jan Strejček +1
We introduce new algorithms for computing non-termination sensitive control dependence (NTSCD) and decisive order dependence (DOD). These relations on control flow graph vertices h…
Minimizing Running Costs in Consumption Systems
Tomáš Brázdil, David Klaška, Antonín Kučera +1
A standard approach to optimizing long-run running costs of discrete systems is based on minimizing the mean-payoff, i.e., the long-run average amount of resources ("energy") consu…