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

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F05%3A00012708%21RIV10-GA0-14330___
rdf:type
skos:Concept n11:Vysledek
dcterms:description
We introduce a family of long-run average properties of Markov chains that are useful for purposes of performance and reliability analysis, and show that these properties can effectively be checked for a subclass of infinite-state Markov chains generated by probabilistic programs with recursive procedures. We also show how to predict these properties by analyzing finite prefixes of runs, and present an efficient prediction algorithm for the mentioned subclass of Markov chains. We introduce a family of long-run average properties of Markov chains that are useful for purposes of performance and reliability analysis, and show that these properties can effectively be checked for a subclass of infinite-state Markov chains generated by probabilistic programs with recursive procedures. We also show how to predict these properties by analyzing finite prefixes of runs, and present an efficient prediction algorithm for the mentioned subclass of Markov chains.
dcterms:title
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion
skos:prefLabel
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion
skos:notation
RIV/00216224:14330/05:00012708!RIV10-GA0-14330___
n4:aktivita
n9:P n9:Z
n4:aktivity
P(1M0545), P(GA201/03/1161), Z(MSM0021622419)
n4:dodaniDat
n7:2010
n4:domaciTvurceVysledku
n12:9872655 n12:1762834
n4:druhVysledku
n22:D
n4:duvernostUdaju
n14:S
n4:entitaPredkladatele
n5:predkladatel
n4:idSjednocenehoVysledku
512007
n4:idVysledku
RIV/00216224:14330/05:00012708
n4:jazykVysledku
n21:eng
n4:klicovaSlova
Probabilistic Pushdown Automata; Infinite Markov Chains; Quantitative Analysis
n4:klicoveSlovo
n13:Probabilistic%20Pushdown%20Automata n13:Quantitative%20Analysis n13:Infinite%20Markov%20Chains
n4:kontrolniKodProRIV
[7E497778B15F]
n4:mistoKonaniAkce
Pittsburgh, Pennsylvania, USA
n4:mistoVydani
Los Alamitos, California
n4:nazevZdroje
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005)
n4:obor
n8:IN
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
3
n4:projekt
n10:1M0545 n10:GA201%2F03%2F1161
n4:rokUplatneniVysledku
n7:2005
n4:tvurceVysledku
Kučera, Antonín Esparza, Javier Brázdil, Tomáš
n4:typAkce
n20:WRD
n4:zahajeniAkce
2005-10-23+02:00
n4:zamer
n19:MSM0021622419
s:numberOfPages
10
n15:hasPublisher
IEEE Computer Society
n16:isbn
0-7695-2468-0
n18:organizacniJednotka
14330