Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
From MaRDI portal
Publication:2233425
Cites work
- scientific article; zbMATH DE number 3128733 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 2067974 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- Alternating-time temporal logic
- Approximating the termination value of one-counter MDPs and stochastic games
- Automata, Languages and Programming
- Computer Science Logic
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Decisive Markov Chains
- Energy and Mean-Payoff Parity Markov Decision Processes
- Energy parity games
- Energy parity games
- Exponential lower bounds for policy iteration
- Fixed-dimensional energy games are in pseudo-polynomial time
- Fun with fireWire: A comparative study of formal verification methods applied to the IEEE 1394 root contention protocol
- Generalized Parity Games
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- MDPs with energy-parity objectives
- Markov decision processes with multiple long-run average objectives
- On strong determinacy of countable stochastic games
- One-counter Markov decision processes
- One-counter stochastic games
- Optimizing the expected mean payoff in energy Markov decision processes
- Perfect-information stochastic mean-payoff parity games
- Qualitative analysis of VASS-induced MDPs
- Quantitative stochastic parity games
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
- Solving parity games on integer vectors
- Stochastic Games
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
- Supervisory Control of a Class of Discrete Event Processes
- The complexity of multi-mean-payoff and multi-energy games
- The determinacy of Blackwell games
- Undecidable problems for probabilistic automata of fixed dimension
- Unifying two views on multiple mean-payoff objectives in Markov decision processes
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
- Zero-reachability in probabilistic multi-counter automata
Cited in
(2)
This page was built for publication: Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233425)
