Quantitative temporal logics: PSPACE and below

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn , Issue , 2005, Pages 138-146

  Lutz, Carsten ^a   Walther, Dirk ^b   Wolter, Frank ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODING; METRIC EXTENSION; REAL LINE; SATISFIABILITY; TEMPORAL OPERATORS; TIME UNITS;

LINGUISTICS; TEMPORAL LOGIC;

COMPUTATIONAL COMPLEXITY;

EID: 40849143615     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2005.31     Document Type: Conference Paper

References (10)

1. R. Alur, T. Feder, and T. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43: 116-146, 1996.
2. R. Alur and T. Henzinger. Logics and models of real time: a survey. In Real Time: Theory and Practice, Lecture Notes in Computer Science, pages 74-106, Berlin, 1992. Springer.
3. R. Alur and T. Henzinger. A really temporal logic. Journal of the ACM, 41:181-204, 1994.
4. E. Emerson, A. Mok, A. Sistla, and J. Srinivasan. Quantitative temporal reasoning. Real-Time Systems, 4:331-352, 1992.
5. Y. Hirshfeld and A. Rabinovich. Logics for real time: Decidability and complexity. Fundamenta Informati-cae, 62:1-28, 2004.
6. C. Lutz, D. Walther, and F. Wolter. Quantitative temporal logics: PSpace and below. LTCS-Report 05-03, Technical University Dresden, 2005. see http://lat.inf.tu-dresden.de/research/reports.html.
7. M. Reynolds. The complexity of the temporal logic over the reals. manuscript.
8. P. Schobbens, J. Raskin, and T. Henzinger. Axioms for real-time logics. Theoretical Computer Science, 274:151-182, 2002.
9. A. Sistla and E. Clarke. The complexity of prepositional linear temporal logics. Journal of the Association for Computing Machinery, 32:733-749, 1985.
10. F. Wolter. Tense logic without tense operators. Mathematical Logic Quarterly, pages 145-171, 1996.