On the expressivity and complexity of quantitative branching-time temporal logics

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.

[1]  Luca Aceto,et al.  Is your model checker on time? On the complexity of model checking for timed modal logics , 1999, J. Log. Algebraic Methods Program..

[2]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[3]  Philippe Schnoebelen,et al.  The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract) , 1998, STACS.

[4]  Farn Wang,et al.  Symbolic model checking for event-driven real-time systems , 1997, TOPL.

[5]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[6]  E. Allen Emerson,et al.  Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach , 1997, TAPSOFT.

[7]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  E. Allen Emerson,et al.  Parametric quantitative temporal reasoning , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[9]  A. Prasad Sistla,et al.  Quantitative Temporal Reasoning , 1990, CAV.

[10]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

[11]  Thomas Wilke.  CTL+ is Exponentially more Succinct than CTL , 1999, FSTTCS.

[12]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[13]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..