Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.