Undecidability of model-checking branching-time properties of stateless probabilistic pushdown process [article]

Tianrong Lin
2021 arXiv   pre-print
In this paper, we settle a problem in probabilistic verification of infinite–state process (specifically, probabilistic pushdown process). We show that model checking stateless probabilistic pushdown process (pBPA) against probabilistic computational tree logic (PCTL) is undecidable.
arXiv:1405.4806v13 fatcat:npzuzvegybhyrfke3x2fxcyqcy