Positivity-hardness results on Markov decision processes
From MaRDI portal
Publication:6566469
DOI10.46298/THEORETICS.24.9MaRDI QIDQ6566469FDOQ6566469
Jakob Piribauer, Christel Baier
Publication date: 3 July 2024
Published in: TheoretiCS (Search for Journal in Brave)
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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)