On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics.

Abstract

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 the introduction of freeze quantifiers leads to a complexity blow-up.
No file

Dates and versions

inria-00104142 , version 1 (05-10-2006)

Identifiers

  • HAL Id : inria-00104142 , version 1

Cite

François Laroussinie, Philippe Schnoebelen, Mathieu Turuani. On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics.. LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Apr 2000, Punta del Este, Uruguay, pp.437-446. ⟨inria-00104142⟩
26 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More