Tail-Bound Cost Analysis over Nondeterministic Probabilistic Programs

For probabilistic programs, there is some work for qualitative and quantitative analysis about expectation or mean, such as expected termination time, and expected cost analysis. However, another non-trivial issue is about tail bounds (i.e., upper bounds of tail probabilities), which can provide hig...

Full description

Saved in:

Bibliographic Details
Published in:	Shanghai jiao tong da xue xue bao Vol. 28; no. 6; pp. 772 - 782
Main Author:	Wang, Peixin
Format:	Journal Article
Language:	English
Published:	Shanghai Shanghai Jiaotong University Press 01.12.2023 Springer Nature B.V
Subjects:	Algorithms Architecture Computer Science Cost analysis Electrical Engineering Engineering Life Sciences Materials Science Polynomials Qualitative analysis Statistical analysis Tails Upper bounds program cost analysis A 尾部界限 probabilistic programs 鞅 TP 31 martingales tail bound 程序消耗分析概率程序
ISSN:	1007-1172, 1674-8115, 1995-8188
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!