On the expressivity and complexity of qu
✍
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