Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
Abstract
In this communication, we resolve a longstanding open question in the probabilistic verification of infinite-state systems. We show that model checking stateless probabilistic pushdown systems (pBPA) against probabilistic computational tree logic (PCTL) is generally undecidable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.