loading...
Stochastic Games with Branching-Time Winning Objectives
Seattle, Washington August 12-August 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2006.4821st Annual IEEE Symposium on Logic i ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.