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 for the largest logic we consider, while introducing freeze quantifiers leads to a complexity blow-up. © Springer-Verlag Berlin Heidelberg 2000.
CITATION STYLE
Laroussinie, F., Schnoebelen, P., & Turuani, M. (2000). On the expressivity and complexity of quantitative branching-time temporal logics. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1776 LNCS, 437–446. https://doi.org/10.1007/10719839_43
Mendeley helps you to discover research relevant for your work.