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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F07%3A00025651%21RIV10-MSM-14330___
rdf:type
skos:Concept n13:Vysledek
dcterms:description
We consider a class of finite 1.5-player games (Markov decision processes) where the winning objectives are specified in the branching-time temporal logic qPECTL* (an extension of the qualitative PCTL*). We study decidability and complexity of existence of a winning strategy in these games. We identify a fragment of qPECTL* called detPECTL* for which the existence of a winning strategy is decidable in exponential time, and also the winning strategy can be computed in exponential time (if it exists). Consequently we show that every formula of qPECTL* can be translated to a formula of detPECTL* (in exponential time) so that the resulting formula is equivalent to the original one over finite Markov chains. From this we obtain that for the whole qPECTL*, the existence of a winning finite-memory strategy is decidable in double exponential time. An immediate consequence is that the existence of a winning finite-memory strategy is decidable for the qualitative fragment of PCTL* in triple exponential time. We consider a class of finite 1.5-player games (Markov decision processes) where the winning objectives are specified in the branching-time temporal logic qPECTL* (an extension of the qualitative PCTL*). We study decidability and complexity of existence of a winning strategy in these games. We identify a fragment of qPECTL* called detPECTL* for which the existence of a winning strategy is decidable in exponential time, and also the winning strategy can be computed in exponential time (if it exists). Consequently we show that every formula of qPECTL* can be translated to a formula of detPECTL* (in exponential time) so that the resulting formula is equivalent to the original one over finite Markov chains. From this we obtain that for the whole qPECTL*, the existence of a winning finite-memory strategy is decidable in double exponential time. An immediate consequence is that the existence of a winning finite-memory strategy is decidable for the qualitative fragment of PCTL* in triple exponential time.
dcterms:title
Strategy Synthesis for Markov Decision Processes and Branching-Time Logics Strategy Synthesis for Markov Decision Processes and Branching-Time Logics
skos:prefLabel
Strategy Synthesis for Markov Decision Processes and Branching-Time Logics Strategy Synthesis for Markov Decision Processes and Branching-Time Logics
skos:notation
RIV/00216224:14330/07:00025651!RIV10-MSM-14330___
n4:aktivita
n9:P
n4:aktivity
P(1M0545)
n4:dodaniDat
n14:2010
n4:domaciTvurceVysledku
n10:2477912 n10:1762834
n4:druhVysledku
n6:O
n4:duvernostUdaju
n17:S
n4:entitaPredkladatele
n8:predkladatel
n4:idSjednocenehoVysledku
452658
n4:idVysledku
RIV/00216224:14330/07:00025651
n4:jazykVysledku
n16:eng
n4:klicovaSlova
Markov decision processes; branching-time logics
n4:klicoveSlovo
n15:Markov%20decision%20processes n15:branching-time%20logics
n4:kontrolniKodProRIV
[81E0468E9F64]
n4:obor
n12:IN
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
2
n4:projekt
n11:1M0545
n4:rokUplatneniVysledku
n14:2007
n4:tvurceVysledku
Brázdil, Tomáš Forejt, Vojtěch
n5:organizacniJednotka
14330