Regularity in PDA Games Revisited

Authors:
Václav Brožek
Affiliations:
ITI FI, Masaryk University, Botanická 68a, 602 00 Brno, Brno, Czech Republic
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 4
Cited 0

Quantitative stochastic parity games

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Reachability in recursive Markov decision processes

Information and Computation
Efficient qualitative analysis of classes of recursive markov decision processes and simple stochastic games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the regularity of sets of winning configurations (winning regions) in countable-state stochastic games played on transition graphs of pushdown automata (PDA games) with reachability objectives. Our main result is proving the regularity of winning regions for qualitative reachability objectives. This completes the classification partially given in a previous paper on this topic. We also improve the upper bounds on the regular representation in cases already solved. We further mention a problem which has also been studied recently: determining the value of a reachability game. Using our methods we prove the regularity of the set of configurations with value 1 and 0.