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

Authors:
F. Laroussinie;Ph. Schnoebelen;M. Turuani
Affiliations:
Lab. Specification and Verification, ENS de Cachan and CNRS UMR 8643, 61 av. Pdt Wilson, F-94235 Cachan Cedex, France;Lab. Specification and Verification, ENS de Cachan and CNRS UMR 8643, 61 av. Pdt Wilson, F-94235 Cachan Cedex, France;LORIA, Campus Scientifique, BP 239, F-54506 Vandoeuvre-lès-Nancy Cedex, France
Venue:
Theoretical Computer Science - Latin American theoretical informatics
Year:
2003

Citing 18
Cited 3

Characterizing finite Kripke structures in propositional temporal logic

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Specifying real-time properties with metric temporal logic

Real-Time Systems
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Quantitative temporal reasoning

Real-Time Systems
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A really temporal logic

Journal of the ACM (JACM)
Model-checking in dense real-time

Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Symbolic model checking for event-driven real-time systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking

Model checking
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
On programming of arithmetic operations

Communications of the ACM
The complexity of propositional linear temporal logics in simple cases

Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
On Model Checking Durational Kripke Structures

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Quantitative Temporal Reasoning

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Logics and Models of Real Time: A Survey

Proceedings of the Real-Time: Theory in Practice, REX Workshop
Parametric Quantitative Temporal Reasoning

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Efficient timed model checking for discrete-time systems

Theoretical Computer Science
MASL: A Logic for the Specification of Multiagent Real-Time Systems

CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
Counting CTL

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures

Quantified Score

Hi-index	0.01

Visualization

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.