𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Structural Epochs in the Complexity of Software over Time

✍ Scribed by Sangwan, R.S.; Vercellone-Smith, P.; Laplante, P.A.


Book ID
119811956
Publisher
IEEE
Year
2008
Tongue
English
Weight
432 KB
Volume
25
Category
Article
ISSN
0740-7459

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The complexity of the temporal logic wit
✍ M. Reynolds πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 350 KB

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