This HTML5 document contains 47 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/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F08%3A00024683%21RIV10-GA0-14330___/
n15http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/ontology/domain/vavai/
n6http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F08%3A00024683%21RIV10-GA0-14330___
rdf:type
n8:Vysledek skos:Concept
dcterms:description
We consider a class of infinite-state Markov decision processes generated by stateless pushdown automata. This class corresponds to 1.5-player games over graphs generated by BPA systems or (equivalently) 1-exit recursive state machines. An extended reachability objective is specified by two sets S and T of safe and terminal stack configurations, where the membership to S and T depends just on the top-of-the-stack symbol. The question is whether there is a suitable strategy such that the probability of hitting a terminal configuration by a path leading only through safe configurations is equal to (or different from) a given x in {0,1}. We show that the qualitative extended reachability problem is decidable in polynomial time, and that the set of all configurations for which there is a winning strategy is effectively regular. More precisely, this set can be represented by a deterministic finite-state automaton with a fixed number of control states. We consider a class of infinite-state Markov decision processes generated by stateless pushdown automata. This class corresponds to 1.5-player games over graphs generated by BPA systems or (equivalently) 1-exit recursive state machines. An extended reachability objective is specified by two sets S and T of safe and terminal stack configurations, where the membership to S and T depends just on the top-of-the-stack symbol. The question is whether there is a suitable strategy such that the probability of hitting a terminal configuration by a path leading only through safe configurations is equal to (or different from) a given x in {0,1}. We show that the qualitative extended reachability problem is decidable in polynomial time, and that the set of all configurations for which there is a winning strategy is effectively regular. More precisely, this set can be represented by a deterministic finite-state automaton with a fixed number of control states.
dcterms:title
Reachability in Recursive Markov Decision Processes Reachability in Recursive Markov Decision Processes
skos:prefLabel
Reachability in Recursive Markov Decision Processes Reachability in Recursive Markov Decision Processes
skos:notation
RIV/00216224:14330/08:00024683!RIV10-GA0-14330___
n4:aktivita
n14:Z n14:P
n4:aktivity
P(1M0545), P(GD102/05/H050), Z(MSM0021622419)
n4:cisloPeriodika
5
n4:dodaniDat
n9:2010
n4:domaciTvurceVysledku
n5:9872655 n5:5532787 n5:2477912 n5:1762834
n4:druhVysledku
n19:J
n4:duvernostUdaju
n12:S
n4:entitaPredkladatele
n18:predkladatel
n4:idSjednocenehoVysledku
391530
n4:idVysledku
RIV/00216224:14330/08:00024683
n4:jazykVysledku
n17:eng
n4:klicovaSlova
Markov decision processes; temporal logics; reachability
n4:klicoveSlovo
n13:temporal%20logics n13:Markov%20decision%20processes n13:reachability
n4:kodStatuVydavatele
US - Spojené státy americké
n4:kontrolniKodProRIV
[02FB1C3C44F7]
n4:nazevZdroje
Information and Computation
n4:obor
n16:IN
n4:pocetDomacichTvurcuVysledku
4
n4:pocetTvurcuVysledku
4
n4:projekt
n11:GD102%2F05%2FH050 n11:1M0545
n4:rokUplatneniVysledku
n9:2008
n4:svazekPeriodika
206
n4:tvurceVysledku
Brožek, Václav Forejt, Vojtěch Brázdil, Tomáš Kučera, Antonín
n4:wos
000256002800003
n4:zamer
n6:MSM0021622419
s:issn
0890-5401
s:numberOfPages
18
n15:organizacniJednotka
14330