In this paper, we settle a problem in probabilistic verification of infinite--state process (specifically, {\it probabilistic pushdown process}). We show that model checking {\it stateless probabilistic pushdown process} (pBPA) against {\it probabilistic computational tree logic} (PCTL) is undecidable.

中文翻译：

---

无状态概率下推过程的模型检查分支时间属性的不可判定性

在本文中，我们解决了无限状态过程（具体来说，{\it probabilistic pushdown process}）的概率验证问题。我们表明，针对 {\it 概率计算树逻辑}（PCTL）的模型检查 {\it 无状态概率下推过程}（pBPA）是不可判定的。