Timer formulas and decidable metric temporal logic

Information and Computation - Tập 198 - Trang 148-178 - 2005
Yoram Hirshfeld1, Alexander Rabinovich1
1Department of Computer Science, School of Computer Sciences, The Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Schreiber Building, Room 120, IL-69978 Ramat Aviv, Tel Aviv, Israel

Tài liệu tham khảo

Alur, 1996, The benefits of relaxing punctuality, Journal of the ACM, 43, 116, 10.1145/227595.227602 R. Alur, T.A. Henzinger, Logics and models of real time: a survey, in: de Bakker et al. (Eds.), Real Time: Theory and Practice, LNCS, vol. 600, 1992, pp. 74–106 R. Alur, T.A. Henzinger, Back to the future: toward theory of timed regular languages, in: 33th FOCS, 1992, pp. 177–186 Alur, 1993, Real time logic: complexity and expressiveness, Information and Computation, 104, 35, 10.1006/inco.1993.1025 Büchi, 1960, On a decision method in restricted second order arithmetic, 1 Burges, 1985, The decision problem for temporal logic, Notre Dame J. Formal Logic, 26, 115, 10.1305/ndjfl/1093870820 D.M. Gabbay, I. Hodkinson, M. Reynolds, Temporal Logics, vol. 1, Clarendon Press, Oxford, 1994 D.M. Gabbay, A. Pnueli, S. Shelah, J. Stavi, On the temporal analysis of fairness, in: 7th ACM Symposium on Principles of Programming Languages, Las Vegas, 1980, pp. 163–173 T.A. Henzinger, It’s about time: real-time logics reviewed, in: Concur 98, Lecture Notes in Computer Science, vol. 1466, 1998 T.A. Henzinger, J.F. Raskin, P.Y. Schobbens, The regular real time languages, in: 25th ICALP Colloquium, 1998 Hirshfeld, 1999, A framework for decidable metrical logics, vol. 1644, 422 Hirshfeld, 1999, Quantitative temporal logic, vol. 1683, 172 Hirshfeld, 2004, Logics for real time: decidability and complexity, Fundamenta Informaricae, 64, 1 H. Kamp, Tense logic and the theory of linear order. PhD thesis, University of California L.A. (1968) Manna, 1993, Models of reactivity, Acta Informatica, 30, 609, 10.1007/BF01191722 Rabin, 1969, Decidability of second order theories and automata on infinite trees, Transactions of American Mathematical Society, 141, 1 Rabinovich, 1998, On the decidability of continuous time specification formalisms, Journal of Logic and Computation, 669, 10.1093/logcom/8.5.669 A. Rabinovich, On the complexity of TL over the reals, Manuscript (1998) M. Reynolds, The complexity of the temporal logic over the reals, Manuscript (1999) Shelah, 1975, The monadic theory of order, Annals of Mathematics, 102, 349, 10.2307/1971037 T. Wilke, Specifying time state sequences in powerful decidable logics and time automata, in: Formal Techniques in Real Time and Fault Tolerance Systems, LNCS, vol. 863, 1994, pp. 694–715