About: Efficient Analysis of Probabilistic Programs with an Unbounded Counter

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Efficient Analysis of Probabilistic Programs with an Unbounded Counter Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. We start by establishing a powerful link between pOC and martingale theory, which leads to fundamental observations about quantitative properties of runs in pOC. In particular, we provide a “divergence gap theorem”, which bounds a positive non-termination probability in pOC away from zero. Using these observations, we show that the expected termination time can be approximated up to an arbitrarily small relative error in polynomial time, and the same holds for the probability of all runs that satisfy a given omega-regular property encoded by a deterministic Rabin automaton. 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. We start by establishing a powerful link between pOC and martingale theory, which leads to fundamental observations about quantitative properties of runs in pOC. In particular, we provide a “divergence gap theorem”, which bounds a positive non-termination probability in pOC away from zero. Using these observations, we show that the expected termination time can be approximated up to an arbitrarily small relative error in polynomial time, and the same holds for the probability of all runs that satisfy a given omega-regular property encoded by a deterministic Rabin automaton. (en)
Title	Efficient Analysis of Probabilistic Programs with an Unbounded Counter Efficient Analysis of Probabilistic Programs with an Unbounded Counter (en)
skos:prefLabel	Efficient Analysis of Probabilistic Programs with an Unbounded Counter Efficient Analysis of Probabilistic Programs with an Unbounded Counter (en)
skos:notation	RIV/00216224:14330/14:00074284!RIV15-MSM-14330___
http://linked.open...avai/riv/aktivita	I P S
http://linked.open...avai/riv/aktivity	I, P(GBP202/12/G061), S
http://linked.open...iv/cisloPeriodika	6
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Brázdil, Tomáš Kučera, Antonín
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	13851
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/14:00074284
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Markov chains; model-checking; one-counter automata (en)
http://linked.open.../riv/klicoveSlovo	one-counter automata Markov chains model-checking
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[4A54920FA225]
http://linked.open...i/riv/nazevZdroje	Journal of the ACM
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Center of excellence - Institute for theoretical computer science (CE-ITI)
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	61
http://linked.open...iv/tvurceVysledku	Brázdil, Tomáš Kučera, Antonín Kiefer, Stefan
http://linked.open...ain/vavai/riv/wos	000347051200008
issn	0004-5411
number of pages	35 (xsd:int)
http://bibframe.org/vocab/doi	10.1145/2629599
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software