Model Checking Probabilistic Pushdown Automata

Details Model Checking Probabilistic Pushdown Automata Model Checking Probabilistic Pushdown Automata

2005-07-31

arxiv.org/abs/cs/0508003v5

LMCS 2 (1:2) 2006

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-2(1:2)2006

We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model checking for this class of properties and pPDA is decidable. Then we show that model checking for the qualitative fragment of the logic PCTL and pPDA is also decidable. Moreover, we develop an error-tolerant model checking algorithm for PCTL and the subclass of stateless pPDA. Finally, we consider the class of omega-regular properties and show that both qualitative and quantitative model checking for pPDA is decidable.

Affiliated with

Also associated with

No associations

Rating

Model Checking Probabilistic Pushdown Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Model Checking Probabilistic Pushdown Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model Checking Probabilistic Pushdown Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-109191