Positivity-hardness results on Markov decision processes

Cites work

scientific article; zbMATH DE number 3823893 (Why is no real title available?)
scientific article; zbMATH DE number 700091 (Why is no real title available?)
scientific article; zbMATH DE number 1973372 (Why is no real title available?)
scientific article; zbMATH DE number 7297838 (Why is no real title available?)
scientific article; zbMATH DE number 3371972 (Why is no real title available?)
Abstraction, Refinement and Proof for Probabilistic Systems
Approximate verification of the symbolic dynamics of Markov chains
Approximating the termination value of one-counter MDPs and stochastic games
Automatic verification of competitive stochastic systems
Classical recursion theory. The theory of functions and sets of natural numbers.
Computer Aided Verification
Computing quantiles in Markov reward models
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}$$
Decision problems for linear recurrence sequences
Energy and Mean-Payoff Parity Markov Decision Processes
Linear Programming and Markov Decision Chains
MDPs with energy-parity objectives
Minimizing expected termination time in one-counter Markov decision processes
Occurrence of zero in a linear recursive sequence
On frequency LTL in probabilistic systems
On the Skolem problem for continuous linear dynamical systems
On the hardness of almost-sure termination
On the positivity problem for simple linear recurrence sequences
On the undecidability of probabilistic planning and related stochastic optimization problems
One-counter Markov decision processes
Optimizing the expected mean payoff in energy Markov decision processes
PRISM-games: a model checker for stochastic multi-player games
Partial and conditional expectations in Markov decision processes with integer weights
Percentile queries in multi-dimensional Markov decision processes
Positivity problems for low-order linear recurrence sequences
Reachability problems for Markov chains
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Recursive Markov decision processes and recursive stochastic games
Stochastic shortest paths and weight-bounded properties in Markov decision processes
Termination analysis of probabilistic programs through Positivstellensatz's
The complexity of probabilistic verification
The odds of staying on budget
Ultimate positivity is decidable for simple linear recurrence sequences
Understanding probabilistic programs

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)