Stochastic Games with Branching-Time Winning Objectives

Authors:
Tomas Brazdil;Vaclav Bro!zek;Vojtech Forejt;Antonin Kucera
Affiliations:
Masaryk University, Czech Republic;Masaryk University, Czech Republic;Masaryk University, Czech Republic;Masaryk University, Czech Republic
Venue:
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Year:
2006

Citing 0
Cited 7

On the Controller Synthesis for Finite-State Markov Decision Processes

Fundamenta Informaticae
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Probabilistic modal µ-calculus with independent product

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
On the Controller Synthesis for Finite-State Markov Decision Processes

Fundamenta Informaticae
Strategy synthesis for markov decision processes and branching-time logics

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
On the complexity of model checking interval-valued discrete time Markov chains

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider stochastic turn-based games where the winning objectives are given by formulae of the branching-time logic PCTL. These games are generally not determined and winning strategies may require memory and/or randomization. Our main results concern history-dependent strategies.