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

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

Namespace Prefixes

PrefixIRI
n20http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n4http://localhost/temp/predkladatel/
n3http://purl.org/net/nknouf/ns/bibtex#
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/ontology/domain/vavai/
n9https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://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#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F07%3A00022548%21RIV10-MSM-14330___/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F07%3A00022548%21RIV10-MSM-14330___
rdf:type
n10:Vysledek skos:Concept
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:00022548!RIV10-MSM-14330___
n5:aktivita
n17:P
n5:aktivity
P(1M0545)
n5:dodaniDat
n7:2010
n5:domaciTvurceVysledku
n15:2477912 n15:1762834
n5:druhVysledku
n21:D
n5:duvernostUdaju
n14:S
n5:entitaPredkladatele
n8:predkladatel
n5:idSjednocenehoVysledku
452659
n5:idVysledku
RIV/00216224:14330/07:00022548
n5:jazykVysledku
n19:eng
n5:klicovaSlova
Markov decision processes; branching-time logics
n5:klicoveSlovo
n18:Markov%20decision%20processes n18:branching-time%20logics
n5:kontrolniKodProRIV
[5D27CC9F5079]
n5:mistoKonaniAkce
Lisabon
n5:mistoVydani
Berlin Heidelberg New York
n5:nazevZdroje
Proceedings of 18th International Conference on Concurrency Theory (CONCUR 2007)
n5:obor
n12:IN
n5:pocetDomacichTvurcuVysledku
2
n5:pocetTvurcuVysledku
2
n5:projekt
n11:1M0545
n5:rokUplatneniVysledku
n7:2007
n5:tvurceVysledku
Brázdil, Tomáš Forejt, Vojtěch
n5:typAkce
n20:WRD
n5:zahajeniAkce
2007-01-01+01:00
s:numberOfPages
17
n3:hasPublisher
Springer-Verlag
n9:isbn
978-3-540-74406-1
n4:organizacniJednotka
14330