License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.113
URN: urn:nbn:de:0030-drops-91174
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9117/
Aguirre, Alejandro ;
Barthe, Gilles ;
Hsu, Justin ;
Silva, Alexandra
Almost Sure Productivity
Abstract
We introduce Almost Sure Productivity (ASP), a probabilistic generalization of the productivity condition for coinductively defined structures. Intuitively, a probabilistic coinductive stream or tree is ASP if it produces infinitely many outputs with probability 1. Formally, we define ASP using a final coalgebra semantics of programs inspired by Kerstan and König. Then, we introduce a core language for probabilistic streams and trees, and provide two approaches to verify ASP: a syntactic sufficient criterion, and a decision procedure by reduction to model{-}checking LTL formulas on probabilistic pushdown automata.
BibTeX - Entry
@InProceedings{aguirre_et_al:LIPIcs:2018:9117,
author = {Alejandro Aguirre and Gilles Barthe and Justin Hsu and Alexandra Silva},
title = {{Almost Sure Productivity}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {113:1--113:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-076-7},
ISSN = {1868-8969},
year = {2018},
volume = {107},
editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9117},
URN = {urn:nbn:de:0030-drops-91174},
doi = {10.4230/LIPIcs.ICALP.2018.113},
annote = {Keywords: Coinduction, Probabilistic Programming, Productivity}
}
Keywords: |
|
Coinduction, Probabilistic Programming, Productivity |
Collection: |
|
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) |
Issue Date: |
|
2018 |
Date of publication: |
|
04.07.2018 |