The complexity of temporal logic over the reals

It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense time temporal logic. Key words: temporal logic PACS:

• Type: Journal
• Year: 2010
• Where: APAL
• Authors: M. Reynolds
• Keywords: APAL 2010, Temporal Logic, Temporal Logic Pacs, Time Temporal Logic