𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of metric temporal logics with counting and the Pnueli modalities

✍ Scribed by Alexander Rabinovich

Book ID
108281629
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
397 KB
Volume
411
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the expressivity and complexity of qu
On the expressivity and complexity of quantitative branching-time temporal logics
✍ F. Laroussinie; Ph. Schnoebelen; M. Turuani πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 347 KB

We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discrete-time framework, and study the expressive power of several relevant logics. When only subscripted modalities are used, polynomial-time model checking is possible even

The complexity of the temporal logic wit
The complexity of the temporal logic with β€œuntil” over general linear time
✍ 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

Combinations of tense and deontic modali
Combinations of tense and deontic modality: On the approach to temporal logic with historical necessity and conditional obligation
✍ Lennart Γ…qvist πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 344 KB

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