Bounded Satisfiability for PCTL

Details Bounded Satisfiability for PCTL Bounded Satisfiability for PCTL

2012-03-30

arxiv.org/abs/1204.0469v1

Computer Science

Logic in Computer Science

Scientific paper

While model checking PCTL for Markov chains is decidable in polynomial-time, the decidability of PCTL satisfiability, as well as its finite model property, are long standing open problems. While general satisfiability is an intriguing challenge from a purely theoretical point of view, we argue that general solutions would not be of interest to practitioners: such solutions could be too big to be implementable or even infinite. Inspired by bounded synthesis techniques, we turn to the more applied problem of seeking models of a bounded size: we restrict our search to implementable -- and therefore reasonably simple -- models. We propose a procedure to decide whether or not a given PCTL formula has an implementable model by reducing it to an SMT problem. We have implemented our techniques and found that they can be applied to the practical problem of sanity checking -- a procedure that allows a system designer to check whether their formula has an unexpectedly small model.

Affiliated with

Also associated with

No associations

Rating

Bounded Satisfiability for PCTL 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 Bounded Satisfiability for PCTL, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounded Satisfiability for PCTL will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-65250