Positivity-hardness results on Markov decision processes

Cites Work

PRISM-games: a model checker for stochastic multi-player games
Title not available (Why is that?)
The complexity of probabilistic verification
Title not available (Why is that?)
On the undecidability of probabilistic planning and related stochastic optimization problems
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Title not available (Why is that?)
Computer Aided Verification
Abstraction, Refinement and Proof for Probabilistic Systems
Automatic verification of competitive stochastic systems
On the positivity problem for simple linear recurrence sequences
Positivity problems for low-order linear recurrence sequences
Linear Programming and Markov Decision Chains
One-counter Markov decision processes
Classical recursion theory. The theory of functions and sets of natural numbers.
Occurrence of zero in a linear recursive sequence
Title not available (Why is that?)
Reachability problems for Markov chains
Approximate verification of the symbolic dynamics of Markov chains
Recursive Markov decision processes and recursive stochastic games
Understanding probabilistic programs
Termination analysis of probabilistic programs through Positivstellensatz's
Decision problems for linear recurrence sequences
Ultimate positivity is decidable for simple linear recurrence sequences
On the hardness of almost-sure termination
Approximating the termination value of one-counter MDPs and stochastic games
Optimizing the expected mean payoff in energy Markov decision processes
Stochastic shortest paths and weight-bounded properties in Markov decision processes
Percentile queries in multi-dimensional Markov decision processes
On the Skolem problem for continuous linear dynamical systems
Partial and conditional expectations in Markov decision processes with integer weights
The odds of staying on budget
Computing quantiles in Markov reward models
Energy and Mean-Payoff Parity Markov Decision Processes
MDPs with energy-parity objectives
Minimizing expected termination time in one-counter Markov decision processes
Conditional value-at-risk for reachability and mean payoff in Markov decision processes
Controller Synthesis for MDPs and Frequency LTL $$_{\setminus \mathbf{G}\mathbf U}$$
On frequency LTL in probabilistic systems
Title not available (Why is that?)

This page was built for publication: Positivity-hardness results on Markov decision processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566469)