On the hardness of analyzing probabilistic programs
Acta Informatica(2018)
摘要
We study the hardness of deciding probabilistic termination as well as the hardness of approximating expected values (e.g. of program variables) and (co)variances for probabilistic programs. Termination We distinguish two notions of probabilistic termination: Given a program P and an input σ ... ...does P terminate with probability 1 on input σ ? ( almost-sure termination ) ...is the expected time until P terminates on input σ finite? ( positive almost-sure termination ) For both of these notions, we also consider their universal variant, i.e. given a program P , does P terminate on all inputs? We show that deciding almost-sure termination as well as deciding its universal variant is ^0_2 -complete in the arithmetical hierarchy. Deciding positive almost-sure termination is shown to be _2^0 -complete, whereas its universal variant is _3^0 -complete. Expected values Given a probabilistic program P and a random variable f mapping program states to rationals, we show that computing lower and upper bounds on the expected value of f after executing P is _1^0 - and _2^0 -complete, respectively. Deciding whether the expected value equals a given rational value is shown to be ^0_2 -complete. Covariances We show that computing upper and lower bounds on the covariance of two random variables is both _2^0 -complete. Deciding whether the covariance equals a given rational value is shown to be in _3^0 . In addition, this problem is shown to be ^0_2 -hard as well as ^0_2 -hard and thus a “proper” _3^0 -problem. All hardness results on covariances apply to variances as well.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络