The Complexity of Temporal Logic over the Reals

Details The Complexity of Temporal Logic over the Reals The Complexity of Temporal Logic over the Reals

1999-10-13

arxiv.org/abs/cs/9910012v1

Computer Science

Logic in Computer Science

Scientific paper

It is shown that the decision problem for the temporal logic with until and
since connectives over real-numbers time is PSPACE-complete.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675113