Quantitative temporal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1683, Issue , 1999, Pages 172-187

  Hirshfeld, Yoram ^a   Rabinovich, Alexander ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

TEMPORAL LOGIC;

CANONICAL MODELING; PREDICATE LOGIC; REAL LINE;

COMPUTER CIRCUITS;

EID: 84956863045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_13     Document Type: Conference Paper

References (17)

1. R. Alur, D. Dill. A theory of timed Automata. Theoretical Computer Science 126 (1994), 183-235.
2. R. Alur, T. Feder, T.A. Henzinger. The Bene_ts of Relaxing Punctuality. Journal of the ACM 43 (1996) 116-146.
3. R. Alur, T.A. Henzinger. Logics and Models of Real Time: a survey. In Real Time: Theory and Practice. Editors de Bakker et al. LNCS 600 (1992) 74-106.
4. R. Alur, T.A. Henzinger. Back to the future: toward theory of timed regular languages. In 33th FOCS, pp177-186, 1992.
5. R. Alur, T.A. Henzinger. Real Time Logic: Complexity and Expressiveness. Information and Computation 104 (1993) 35-77.
6. A. Bouajjani and Y. Lakhnech. Temporal Logic +Timed Automata: Ex-pressiveness and Decidability. CONCUR95, LNCS 962, pp. 531-547, 1995.
7. J.P. Burges, Y. Gurevich. The Decision Problem for Temporal Logic. Notre Dame J. Formal Logic, 26 (1985) 115-128.
8. D.M. Gabbay, I. Hodkinson, M. Reynolds. Temporal Logics volume 1. Cla-rendon Press, Oxford (1994).
9. D.M. Gabbay, A. Pnueli, S. Shelah, J. Stavi. On the Temporal Analysis of Fairness. 7th ACM Symposium on Principles of Programming Languages. Las Vegas (1980) 163-173.
10. T.A. Henzinger, J.F. Raskin, P.Y. Schobbens. The Regular Real Time Lan-guages. 25th ICALP Colloquium (1998).
11. Y. Hirshfeld and A. Rabinovich, A Framework for Decidable Metrical Lo-gics. To appear in ICALP99, LNCS vol.1644, 1999.
12. H. Kamp. Tense Logic and the Theory of Linear Order. Ph.D. thesis, Uni-versity of California L.A. (1968).
13. A. Rabinovich. On the Decidability of Continuous Time Speci_cation For-malisms. In Journal of Logic and Computation, pp 669-678, 1998.
14. A. Rabinovich. On the complexity of TL over the reals. Manuscript 1998.
15. S. Shelah. The monadic theory of order. Ann. of Math., 102, pp 349-419,1975.
16. B.A. Trakhtenbrot. Dynamic Systems and their interaction: De_nitional Suggestions. TR Tel Aviv University, 1999.
17. T. Wilke. Specifying Time State Sequences in Powerful Decidable Logics and Time Automata. In Formal Techniques in Real Time and Fault Tole-rance Systems. LNCS 863 (1994), 694-715.