Abstract
It is shown that the decision problem for the temporal logic with the strict until operator over general linear time is PSPACE-complete. This shows that it is no harder to reason with arbitrary linear orderings than with discrete linear time temporal logics. New techniques are used to give a PSPACE procedure for the logic.
Original language | English |
---|---|
Pages (from-to) | 393-426 |
Journal | Journal of Computer and System Sciences |
Volume | 66 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2003 |