几乎确定生产力
Almost Sure Productivity
摘要:
我们定义几乎肯定生产力(ASP),共归纳定义的结构的生产力条件的概率概括。直观地说,一个概率共归纳流或树是ASP,如果它以概率1产生无穷多个输出。形式上,我们定义几乎肯定的生产力使用最终的coalgebra语义的启发,从Kerstan和柯尼希的程序。然后,我们介绍了一个核心语言的概率流和树,并提供了两种方法来验证ASP:一个充分的语法标准,并减少模型检查pCTL* 公式的概率下推自动机。约简表明ASP对于我们的核心语言是可判定的。
英文摘要:
We define 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 almost sure productivity using a final coalgebra semantics of programs inspired from Kerstan and König. Then, we introduce a core language for probabilistic streams and trees, and provide two approaches to verify ASP: a sufficient syntactic criterion, and a reduction to model-checking pCTL* formulas on probabilistic pushdown automata. The reduction shows that ASP is decidable for our core language.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。