activity
20092026
most citedMarkov Decision Processes with Multiple Long-run Average Objectives

47 citations · 115 across the 33 of their papers we have counts for

collaborators
Showing cs.FLShow all

5 papers · 1 filter

cs.FL2020

Qualitative Controller Synthesis for Consumption Markov Decision Processes

František Blahoudek, Tomáš Brázdil, Petr Novotný +3

Consumption Markov Decision Processes (CMDPs) are probabilistic decision-making models of resource-constrained systems. In a CMDP, the controller possesses a certain amount of a cr…

cs.FL2019

Deciding Fast Termination for Probabilistic VASS with Nondeterminism

Tomáš Brázdil, Krishnendu Chatterjee, Antonín Kučera +2

A probabilistic vector addition system with states (pVASS) is a finite state Markov process augmented with non-negative integer counters that can be incremented or decremented duri…

cs.FL2014★ 1 cited

Zero-Reachability in Probabilistic Multi-Counter Automata

Tomáš Brázdil, Stefan Kiefer, Antonín Kučera +2

We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concen…

cs.FL2012

Minimizing Expected Termination Time in One-Counter Markov Decision Processes

Tomáš Brázdil, Antonín Kučera, Petr Novotný +1

We consider the problem of computing the value and an optimal strategy for minimizing the expected termination time in one-counter Markov decision processes. Since the value may be…

cs.FL2011★ 1 cited

Efficient Analysis of Probabilistic Programs with an Unbounded Counter

Tomas Brazdil, Stefan Kiefer, Antonin Kucera

We show that a subclass of infinite-state probabilistic programs that can be modeled by probabilistic one-counter automata (pOC) admits an efficient quantitative analysis. In parti…