This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://purl.org/net/nknouf/ns/bibtex#
n8http://localhost/temp/predkladatel/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n19http://linked.opendata.cz/ontology/domain/vavai/
n20https://schema.org/
n13http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F06%3A00017108%21RIV10-MSM-14330___/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n22http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F06%3A00017108%21RIV10-MSM-14330___
rdf:type
skos:Concept n19:Vysledek
dcterms:description
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. In particular, we show that the problem whether there exists a history-dependent winning strategy in 1.5-player games is highly undecidable, even for objectives formulated in the L(F^{=5/8},F^{=1},F^{>0},G^{=1}) fragment of PCTL. On the other hand, we show that the problem becomes decidable (and in fact EXPTIME-complete) for the L(F{=1},F^{>0},G^{=1}) fragment of PCTL, where winning strategies require only finite memory. This result is tight in the sense that winning strategies for L(F^{=1},F^{>0},G^{=1},G^{>0}) objectives may already require infinite memory. 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. In particular, we show that the problem whether there exists a history-dependent winning strategy in 1.5-player games is highly undecidable, even for objectives formulated in the L(F^{=5/8},F^{=1},F^{>0},G^{=1}) fragment of PCTL. On the other hand, we show that the problem becomes decidable (and in fact EXPTIME-complete) for the L(F{=1},F^{>0},G^{=1}) fragment of PCTL, where winning strategies require only finite memory. This result is tight in the sense that winning strategies for L(F^{=1},F^{>0},G^{=1},G^{>0}) objectives may already require infinite memory.
dcterms:title
Stochastic Games with Branching-Time Winning Objectives Stochastic Games with Branching-Time Winning Objectives
skos:prefLabel
Stochastic Games with Branching-Time Winning Objectives Stochastic Games with Branching-Time Winning Objectives
skos:notation
RIV/00216224:14330/06:00017108!RIV10-MSM-14330___
n3:aktivita
n15:Z n15:P
n3:aktivity
P(1M0545), Z(MSM0021622419)
n3:dodaniDat
n17:2010
n3:domaciTvurceVysledku
n9:9872655 n9:1762834 n9:2477912 n9:5532787
n3:druhVysledku
n4:D
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
501652
n3:idVysledku
RIV/00216224:14330/06:00017108
n3:jazykVysledku
n22:eng
n3:klicovaSlova
Stochastic games; branching-time temporal logics
n3:klicoveSlovo
n10:Stochastic%20games n10:branching-time%20temporal%20logics
n3:kontrolniKodProRIV
[FDD58DF532FB]
n3:mistoKonaniAkce
Seattle, Washington, USA
n3:mistoVydani
Los Alamitos, California
n3:nazevZdroje
21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, Washington, USA, Proceedings
n3:obor
n6:IN
n3:pocetDomacichTvurcuVysledku
4
n3:pocetTvurcuVysledku
4
n3:projekt
n12:1M0545
n3:rokUplatneniVysledku
n17:2006
n3:tvurceVysledku
Kučera, Antonín Brožek, Václav Brázdil, Tomáš Forejt, Vojtěch
n3:typAkce
n16:WRD
n3:zahajeniAkce
2006-08-12+02:00
n3:zamer
n13:MSM0021622419
s:numberOfPages
10
n21:hasPublisher
IEEE Computer Society
n20:isbn
0-7695-2631-4
n8:organizacniJednotka
14330