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
The state complexity of ∑ ∗ $̄L and its connection with temporal logic
✍ Scribed by Jean-Camille Birget
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 363 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
IN previous papers 1 the writer has determined the zero of the controllable internal energy and entropy of a substance, and some of the corresponding properties. This zero corresponds to the substance being in the condensed state under its vapor pressure at the absolute zero of temperature. The subj
We consider three infinite hierarchies of what I call "two-dimensional temporal logics with explicit realization operators", viz. (i) one without historical or deontic modalities, (ii) one with historical but without deontic modalities, and (iii) one with historical and with dyadic deontic modalitie