Bounded Reachability for Temporal Logic over Constraint Systems

Details Bounded Reachability for Temporal Logic over Constraint Systems Bounded Reachability for Temporal Logic over Constraint Systems

2010-04-07

arxiv.org/abs/1004.1077v3

Computer Science

Logic in Computer Science

Scientific paper

We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such logic can be undecidable. We introduce suitable restrictions and assumptions that are shown to make the satisfiability problem for the extended logic decidable. Moreover for a large class of constraint systems we propose an encoding that realize an effective decision procedure for the Bounded Reachability problem.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-397244