Probabilistic Model Checking for Propositional Projection Temporal Logic

Details Probabilistic Model Checking for Propositional Projection Temporal Logic Probabilistic Model Checking for Propositional Projection Temporal Logic

2010-11-05

arxiv.org/abs/1011.1321v1

Computer Science

Logic in Computer Science

Scientific paper

Propositional Projection Temporal Logic (PPTL) is a useful formalism for reasoning about period of time in hardware and software systems and can handle both sequential and parallel compositions. In this paper, based on discrete time Markov chains, we investigate the probabilistic model checking approach for PPTL towards verifying arbitrary linear-time properties. We first define a normal form graph, denoted by NFG_inf, to capture the infinite paths of PPTL formulas. Then we present an algorithm to generate the NFG_inf. Since discrete-time Markov chains are the deterministic probabilistic models, we further give an algorithm to determinize and minimize the nondeterministic NFG_inf following the Safra's construction.

Affiliated with

Also associated with

No associations

Rating

Probabilistic Model Checking for Propositional Projection Temporal Logic 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 Probabilistic Model Checking for Propositional Projection Temporal Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Model Checking for Propositional Projection Temporal Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-453722