Emergent Mind
Undecidability of model-checking branching-time properties of stateless probabilistic pushdown process
(1405.4806)
Published May 19, 2014
in
cs.LO
,
cs.FL
,
and
math.LO
Abstract
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.