2000 character limit reached
Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
Published 19 May 2014 in cs.LO, cs.FL, and math.LO | (1405.4806v21)
Abstract: In this communication, we resolve a longstanding open question in the probabilistic verification of infinite-state systems. We show that model checking {\it stateless probabilistic pushdown systems (pBPA)} against {\it probabilistic computational tree logic (PCTL)} is generally undecidable.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
