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
n22http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n15http://localhost/temp/predkladatel/
n12http://purl.org/net/nknouf/ns/bibtex#
n20http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/resource/domain/vavai/subjekt/
n9http://linked.opendata.cz/ontology/domain/vavai/
n4https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F11%3A00054480%21RIV12-MSM-14330___/
n5http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n23http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F11%3A00054480%21RIV12-MSM-14330___
rdf:type
n9:Vysledek skos:Concept
dcterms:description
We show that a subclass of infinite-state probabilistic programs that can be modeled by probabilistic one-counter automata (pOC) admits an efficient quantitative analysis. In particular, we show that the expected termination time can be approximated up to an arbitrarily small relative error with polynomially many arithmetic operations, and the same holds for the probability of all runs that satisfy a given omega-regular property. We show that a subclass of infinite-state probabilistic programs that can be modeled by probabilistic one-counter automata (pOC) admits an efficient quantitative analysis. In particular, we show that the expected termination time can be approximated up to an arbitrarily small relative error with polynomially many arithmetic operations, and the same holds for the probability of all runs that satisfy a given omega-regular property.
dcterms:title
Efficient Analysis of Probabilistic Programs with an Unbounded Counter Efficient Analysis of Probabilistic Programs with an Unbounded Counter
skos:prefLabel
Efficient Analysis of Probabilistic Programs with an Unbounded Counter Efficient Analysis of Probabilistic Programs with an Unbounded Counter
skos:notation
RIV/00216224:14330/11:00054480!RIV12-MSM-14330___
n9:predkladatel
n10:orjk%3A14330
n6:aktivita
n8:P
n6:aktivity
P(1M0545)
n6:dodaniDat
n13:2012
n6:domaciTvurceVysledku
n16:1762834 n16:9872655
n6:druhVysledku
n14:D
n6:duvernostUdaju
n23:S
n6:entitaPredkladatele
n21:predkladatel
n6:idSjednocenehoVysledku
196741
n6:idVysledku
RIV/00216224:14330/11:00054480
n6:jazykVysledku
n18:eng
n6:klicovaSlova
one-counter machines; probabilistic systems; model-checking
n6:klicoveSlovo
n11:model-checking n11:one-counter%20machines n11:probabilistic%20systems
n6:kontrolniKodProRIV
[467A6D34EA24]
n6:mistoKonaniAkce
Snowbird, UT, USA
n6:mistoVydani
Berlin
n6:nazevZdroje
Computer Aided Verification, 23rd International Conference, CAV 2011
n6:obor
n7:IN
n6:pocetDomacichTvurcuVysledku
2
n6:pocetTvurcuVysledku
3
n6:projekt
n20:1M0545
n6:rokUplatneniVysledku
n13:2011
n6:tvurceVysledku
Kiefer, Stefan Kučera, Antonín Brázdil, Tomáš
n6:typAkce
n22:WRD
n6:zahajeniAkce
2011-07-14+02:00
s:numberOfPages
17
n5:doi
10.1007/978-3-642-22110-1
n12:hasPublisher
Springer-Verlag
n4:isbn
978-3-642-22109-5
n15:organizacniJednotka
14330