loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
Stochastic Games with Branching-Time Winning Objectives
Seattle, Washington
August 12-August 15
ISBN: 0-7695-2631-4
ASCII Text
x 
 
Tomas Brazdil, Vaclav Bro?zek, Vojtech Forejt, Antonin Kucera, "Stochastic Games with Branching-Time Winning Objectives," Logic in Computer Science, Symposium on, pp. 349-358, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2006.48,
author = {Tomas Brazdil and Vaclav Bro?zek and Vojtech Forejt and Antonin Kucera},
title = {Stochastic Games with Branching-Time Winning Objectives},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2006},
issn = {1043-6871},
pages = {349-358},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2006.48},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Stochastic Games with Branching-Time Winning Objectives
SN - 1043-6871
SP349
EP358
A1 - Tomas Brazdil,
A1 - Vaclav Bro?zek,
A1 - Vojtech Forejt,
A1 - Antonin Kucera,
PY - 2006
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Tomas Brazdil, Masaryk University, Czech Republic
Vaclav Bro?zek, Masaryk University, Czech Republic
Vojtech Forejt, Masaryk University, Czech Republic
Antonin Kucera, Masaryk University, Czech Republic
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.
Citation:
Tomas Brazdil, Vaclav Bro?zek, Vojtech Forejt, Antonin Kucera, "Stochastic Games with Branching-Time Winning Objectives," lics, pp.349-358, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.