2000 character limit reached
Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems (1405.4806v19)
Published 19 May 2014 in cs.LO, cs.FL, and math.LO
Abstract: In this communication, we resolve a longstanding open question in the probabilistic verification of infinite-state systems. We show that model checking {\em stateless probabilistic pushdown systems (pBPA)} against {\em probabilistic computational tree logic (PCTL)} is generally undecidable.