当前位置:
X-MOL 学术
›
arXiv.cs.FL
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Undecidability of model-checking branching-time properties of stateless probabilistic pushdown process
arXiv - CS - Formal Languages and Automata Theory Pub Date : 2014-05-19 , DOI: arxiv-1405.4806 Tianrong Lin
arXiv - CS - Formal Languages and Automata Theory Pub Date : 2014-05-19 , DOI: arxiv-1405.4806 Tianrong Lin
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)是不可判定的。
更新日期:2020-03-04
中文翻译:
无状态概率下推过程的模型检查分支时间属性的不可判定性
在本文中,我们解决了无限状态过程(具体来说,{\it probabilistic pushdown process})的概率验证问题。我们表明,针对 {\it 概率计算树逻辑}(PCTL)的模型检查 {\it 无状态概率下推过程}(pBPA)是不可判定的。