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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F05%3A00012515%21RIV10-GA0-14330___
rdf:type
n15:Vysledek skos:Concept
dcterms:description
Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic programs with recursive procedure calls. Previous works considered the decidability and complexity of the model-checking problem for pPDA and various probabilistic temporal logics. In this paper we concentrate on computing the expected values and variances of various random variables defined over runs of a given probabilistic pushdown automaton. In particular, we show how to compute the expected accumulated reward and the expected gain for certain classes of reward functions. Using these results, we show how to analyze various quantitative properties of pPDA that are not expressible in conventional probabilistic temporal logics. Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic programs with recursive procedure calls. Previous works considered the decidability and complexity of the model-checking problem for pPDA and various probabilistic temporal logics. In this paper we concentrate on computing the expected values and variances of various random variables defined over runs of a given probabilistic pushdown automaton. In particular, we show how to compute the expected accumulated reward and the expected gain for certain classes of reward functions. Using these results, we show how to analyze various quantitative properties of pPDA that are not expressible in conventional probabilistic temporal logics.
dcterms:title
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances
skos:prefLabel
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances
skos:notation
RIV/00216224:14330/05:00012515!RIV10-GA0-14330___
n3:aktivita
n8:P n8:Z
n3:aktivity
P(1M0545), P(GA201/03/1161), Z(MSM0021622419)
n3:dodaniDat
n5:2010
n3:domaciTvurceVysledku
n14:9872655
n3:druhVysledku
n22:D
n3:duvernostUdaju
n17:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
539824
n3:idVysledku
RIV/00216224:14330/05:00012515
n3:jazykVysledku
n4:eng
n3:klicovaSlova
Probabilistic Pushdown Automata; Infinite Markov Chains; Quantitative Analysis
n3:klicoveSlovo
n16:Probabilistic%20Pushdown%20Automata n16:Quantitative%20Analysis n16:Infinite%20Markov%20Chains
n3:kontrolniKodProRIV
[F23B9A7B3D6A]
n3:mistoKonaniAkce
Chicago, Illinois, USA
n3:mistoVydani
Los Alamitos, California
n3:nazevZdroje
Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005)
n3:obor
n7:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n6:1M0545 n6:GA201%2F03%2F1161
n3:rokUplatneniVysledku
n5:2005
n3:tvurceVysledku
Kučera, Antonín Esparza, Javier Mayr, Richard
n3:typAkce
n21:WRD
n3:zahajeniAkce
2005-07-26+02:00
n3:zamer
n19:MSM0021622419
s:numberOfPages
10
n9:hasPublisher
IEEE Computer Society
n10:isbn
0-7695-2266-1
n20:organizacniJednotka
14330