| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662054 | Annals of Pure and Applied Logic | 2010 | 34 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
