DeepAI
Log In Sign Up

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP

01/18/2021
by   Richard Mayr, et al.
0

We study stochastic games with energy-parity objectives, which combine quantitative rewards with a qualitative ω-regular condition: The maximizer aims to avoid running out of energy while simultaneously satisfying a parity condition. We show that the corresponding almost-sure problem, i.e., checking whether there exists a maximizer strategy that achieves the energy-parity objective with probability 1 when starting at a given energy level k, is decidable and in NP ∩ coNP. The same holds for checking if such a k exists and if a given k is minimal.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/14/2021

Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives

The window mechanism was introduced by Chatterjee et al. to reinforce me...
07/16/2019

Partial Solvers for Generalized Parity Games

Parity games have been broadly studied in recent years for their applica...
02/17/2017

Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes

The beyond worst-case synthesis problem was introduced recently by Bruyè...
04/10/2018

Combinations of Qualitative Winning for Stochastic Parity Games

We study Markov decision processes and turn-based stochastic games with ...
01/04/2021

Symbolic Control for Stochastic Systems via Parity Games

We consider the problem of computing the maximal probability of satisfyi...
10/10/2017

Accelerating Energy Games Solvers on Modern Architectures

Quantitative games, where quantitative objectives are defined on weighte...
01/11/2019

Life is Random, Time is Not: Markov Decision Processes with Window Objectives

The window mechanism was introduced by Chatterjee et al. [1] to strength...