Decidability and complexity of finite-state stochastic games – Bc. Vojtěch Forejt, Ph.D., LL.B. (Hons)
Bc. Vojtěch Forejt, Ph.D., LL.B. (Hons)
Master's thesis
Decidability and complexity of finite-state stochastic games
Decidability and complexity of finite-state stochastic games
Abstract:
We study stochastic turn based games played by two players ($\Box$ and $\Diamond$) and environment $\bigcirc$. The aim of the player $\Box$ is to provide a strategy that ensures satisfying of an objective no matter what strategy the player $\Diamond$ provides. Objectives are specified by the formulae of the logic PCTL (probabilistic extension of CTL) or \PE{} (logic similar to PCTL$^*$ with B\"uchi …more
Language used: English
Date on which the thesis was submitted / produced: 4. 1. 2007
Identifier:
https://is.muni.cz/th/ottrb/
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
-
Problém splnitelnosti pro pravděpodobnostní temporální logiky
Miroslav Chodil -
The satisfiability problem for Probabilistic CTL
Chodil Chodil