Quantitative temporal logics over the reals: PSPACE and below

Information and Computation

Volumn 205, Issue 1, 2007, Pages 99-123

  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

BINS; CODES (SYMBOLS); SEEBECK EFFECT; TEMPORAL LOGIC;

BINARY CODING; COMPLEXITY BOUNDS; METRIC EXTENSION; NUMERICAL PARAMETERS; PSPACE-COMPLETE; REDUCTION TECHNIQUES; SATISFIABILITY; TEMPORAL OPERATORS;

FORMAL LOGIC;

EID: 84855194351     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.08.006     Document Type: Article

References (17)

1. R. Alur, T. Feder, T. Henzinger, The benefits of relaxing punctuality, Journal of the Association for Computing Machinery 43(1996) 116-146. (Pubitemid 126607636)
2. R. Alur, T. Henzinger, Logics and models of real time: a survey, in: Real Time: Theory and Practice, Lecture Notes in Computer Science, Springer, Berlin, 1992, pp. 74-106.
3. R. Alur, T. Henzinger, A really temporal logic, Journal of the Association for Computing Machinery 41(1994) 181-204.
4. B. Bérard, C. Picaronny, Accepting zeno words: a way toward timed refinements, Acta Informatica 37(2000) 45-81.
5. L. Blum, F. Chucker, M. Shub, S. Smale, Complexity and Real Computation, Springer, New York, 1998.
6. E. M. Clarke, O. Grumberg, D. A. Peled, Model Checking, The MIT Press, Cambridge, Massachusetts, 1999.
7. S. Demri, D. Nowak, Reasoning about transfinite sequences (extended abstract), in: Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis (ATVA'05), Lecture Notes in Computer Science, Springer, Berlin, 2005, pp. 248-262.
8. E. Emerson, Temporal and modal logic, in: Handbook of Theoretical Computer Science (vol. B): Formal Models and Semantics, MIT Press, Cambridge, MA, 1990, pp. 995-1072.
9. E. Emerson, A. Mok, A. Sistla, J. Srinivasan, Quantitative temporal reasoning, Real-Time Systems 4(1992) 331-352. (Pubitemid 23581124)
10. M. Hansen, P. Pandya, Z. Chaochen, Finite divergence, Theoretical Computer Science 1(138) (1995) 113-139.
11. Y. Hirshfeld, A. Rabinovich, Logics for real time: decidability and complexity, Fundamenta Informaticae 62(2004) 1-28.
12. A. Pnueli, The temporal logic of programs, in: Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS-77), IEEE Computer Society Press, Silver Spring, MD, 1977, pp. 46-57.
13. Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer-Verlag, Berlin, 1992.
14. M. Reynolds, The complexity of the temporal logic over the reals, submitted (1999), .
15. P. Schobbens, J. Raskin, T. Henzinger, Axioms for real-time logics, Theoretical Computer Science 274(2002) 151-182. (Pubitemid 34189253)
16. A. Sistla, E. Clarke, The complexity of propositional linear temporal logics, Journal ofthe Association for Computing Machinery 32(1985) 733-749. (Pubitemid 15507395)
17. A. P. Sistla, L. D. Zuck, Reasoning in a restricted temporal logic, Information and Computation 102(2) (1993) 167-195.