Axioms for real-time logics

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

Volumn 1466, Issue , 1998, Pages 219-236

  Raskin, J F ^a   Schobbens, P Y ^a   Henzinger, T A ^b  

^a UNIVERSITY OF NAMUR   (Belgium)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

AXIOMATIZATION; COMPLETE AXIOMATIZATIONS; INTERVAL TEMPORAL LOGIC; LINEAR TEMPORAL LOGIC; REAL NUMBER; REAL TIME; REAL-TIME LOGIC;

TEMPORAL LOGIC;

EID: 4644330183     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055625     Document Type: Conference Paper

References (19)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2): 253-284, 1991.
2. R. Alur, C. Courcoubetis, and D.L. Dill. Model checking in dense real time. Information and Computation, 104(1): 2-34, 1993.
3. R. Alur, T. Feder, and T.A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1): 116-146, 1996.
4. R. Alur and T.A. Henzinger. A really temporal logic. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 164-169. IEEE Computer Society Press, 1989.
5. R. Alur and T.A. Henzinger. Back to the future: towards a theory of timed regular languages. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 177-186. IEEE Computer Society Press, 1992.
6. R. Alur and T.A. Henzinger. Logics and models of real time: a survey. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 74-106. Springer-Verlag, 1992.
7. H. Barringer, R. Kuiper, and A. Pnueli. A really abstract concurrent model and its temporal logic. In Proceedings of the 13th Annual Symposium on Principles of Programming Languages, pages 173-183. ACM Press, 1986.
8. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Transactions on Programming Languages and Systems, 8(2): 244-263, 1986.
9. E. Harel, O. Lichtenstein, and A. Pnueli. Explicit-clock temporal logic. In Proceedings of the Fiflh Annual Symposium on Logic in Computer Science, pages 402-413. IEEE Computer Society Press, 1990.
10. T. Henzinger, J.-F. Raskin, and P.-Y. Schobbens. The regular real-time languages. In Kim G. Larsen, editor, ICALP 98: Automata, Languages, and Programming, Lecture Notes in Computer Science. Springer-Verlag, 1998.
11. T.A. Henzinger. Half-order modal logic: how to prove real-time properties. In Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing, pages 281-296. ACM Press, 1990.
12. Yonit Kesten and Amir Pnueli. A complete proof systems for QPTL. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 2-12, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.
13. Ron Koymans. Specifying message passing and time-critical systems with temporal logic. LNCS 651, Springer-Verlag, 1992.
14. O. Lichtenstein and A. Pnueli. Checking that finite-state concurrent programs satisfy their linear specification. In Proceedings of the 12th Annual Symposium on Principles of Programming Languages, pages 97-107. ACM Press, 1985.
15. O. Lichtenstein, A. Pnueli, and L.D. Zuck. The glory of the past. In R. Parikh, editor, Logics of Programs, Lecture Notes in Computer Science 193, pages 196-218. Springer-Verlag, 1985.
16. Z. Manna and A. Pnueli. Completing the temporal picture. In G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, editors, ICALP 89: Automata, Languages, and Programming, Lecture Notes in Computer Science 372, pages 534-558. Springer-Verlag, 1989.
17. J.S. Ostroff. Temporal Logic of Real-time Systems. Research Studies Press, 1990.
18. J.-F. Raskin and P.-Y. Schobbens. State clock logic: a decidable real-time logic. In O. Maler, editor, HART 97: Hybrid and Real-time Systems, Lecture Notes in Computer Science 1201, pages 33-47. Springer-Verlag, 1997.
19. P. Wolper. Synthesis of Communicating Processes from Temporal-Logic Specifications. PhD thesis, Stanford University, 1982.