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

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

Namespace Prefixes

PrefixIRI
n22http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://localhost/temp/predkladatel/
n9http://purl.org/net/nknouf/ns/bibtex#
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/ontology/domain/vavai/
n20https://schema.org/
n14http://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/
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F05%3A00012779%21RIV10-GA0-14330___/
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/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F05%3A00012779%21RIV10-GA0-14330___
rdf:type
skos:Concept n8:Vysledek
dcterms:description
We consider the problem of computing the expected accumulated reward and the average gain per transition in a subclass of Markov chains with countable state spaces where all states are assigned a non-negative reward. We state several abstract conditions that guarantee computability of the above properties up to an arbitrarily small (but non-zero) given error. Finally, we show that our results can be applied to probabilistic lossy channel systems, a well-known model of processes communicating through faulty channels. We consider the problem of computing the expected accumulated reward and the average gain per transition in a subclass of Markov chains with countable state spaces where all states are assigned a non-negative reward. We state several abstract conditions that guarantee computability of the above properties up to an arbitrarily small (but non-zero) given error. Finally, we show that our results can be applied to probabilistic lossy channel systems, a well-known model of processes communicating through faulty channels.
dcterms:title
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
skos:prefLabel
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
skos:notation
RIV/00216224:14330/05:00012779!RIV10-GA0-14330___
n3:aktivita
n5:Z n5:P
n3:aktivity
P(1M0545), P(GA201/03/1161), Z(MSM0021622419)
n3:dodaniDat
n6:2010
n3:domaciTvurceVysledku
n10:1762834 n10:9872655
n3:druhVysledku
n16:D
n3:duvernostUdaju
n4:S
n3:entitaPredkladatele
n21:predkladatel
n3:idSjednocenehoVysledku
516141
n3:idVysledku
RIV/00216224:14330/05:00012779
n3:jazykVysledku
n13:eng
n3:klicovaSlova
Infinite Markov Chains; Expected Reward
n3:klicoveSlovo
n18:Expected%20Reward n18:Infinite%20Markov%20Chains
n3:kontrolniKodProRIV
[A75A76563E24]
n3:mistoKonaniAkce
Hyderabad, India
n3:mistoVydani
Berlin Heidelberg New York
n3:nazevZdroje
25th International Conference on Foundations of Software Technology and Theoretical Computer Science
n3:obor
n15:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n12:GA201%2F03%2F1161 n12:1M0545
n3:rokUplatneniVysledku
n6:2005
n3:tvurceVysledku
Brázdil, Tomáš Kučera, Antonín
n3:typAkce
n22:WRD
n3:wos
000234885800030
n3:zahajeniAkce
2005-01-01+01:00
n3:zamer
n14:MSM0021622419
s:issn
0302-9743
s:numberOfPages
12
n9:hasPublisher
Springer-Verlag
n20:isbn
3-540-30495-9
n17:organizacniJednotka
14330