Decidability and complexity of infinite-state stochastic games – Bc. Václav Brožek, Ph.D.
Bc. Václav Brožek, Ph.D.
Master's thesis
Decidability and complexity of infinite-state stochastic games
Decidability and complexity of infinite-state stochastic games
Abstract:
In this thesis we are concerned in 1 1/2-player stochastic games with infinitely many vertices. We are especially interested in games generated by pushdown automata (PDA) and stateless pushdown automata (BPA). We also define the extended reachability objective (ERO) and prove that for PDA games the reachability problem wrt. ERO is undecidable. On the other hand we give a polynomial-time algorithm to …more
Language used: English
Date on which the thesis was submitted / produced: 4. 1. 2007
Identifier:
https://is.muni.cz/th/jsiqw/
Thesis defence
- Date of defence: 13. 2. 2007
- Supervisor: doc. RNDr. Tomáš Brázdil, Ph.D.
Citation record
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsMaster programme / field:
Informatics / Informatics
Theses on a related topic
-
Determinacy and Optimal Strategies in Stochastic Games
Jan Krčál -
Craig's Interpolant in Model Checking Algorithms
Viktória Vozárová -
Basic model-checking problems for stochastic games
Václav Brožek -
Basic Model Checking Problems for Stochastic Games
Václav Brožek -
Basic model-checking problems for stochastic games
Václav Brožek