Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1998: CONCUR'98 Concurrency Theory pp 219–236Cite as

Axioms for real-time logics

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1466))

Abstract

This paper presents a complete axiomatization of fully decidable propositional real-time linear temporal logics with past: the Event Clock Logic (ECL) and the Metric Interval Temporal Logic with past (MITL). The completeness proof consists of an effective proof building procedure for ECL. From this result we obtain a complete axiomatization of MITL by providing axioms translating MITL formulae into ECL formulae, the two logics being equally expressive. Our proof is structured to yield a similar axiomatization and procedure for interesting fragments of these logics, such as the linear temporal logic of the real numbers (LTR).

This work is supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the DARPA/NASA grant NAG2-1214, by the ARO MURI grant DAAH-04-96-1-0341, by the SRC contract 97-DC-324.041, the Belgian National Fund for Scientific Research (FNRS), the European Commission under WGs Aspire and Fireworks, the Portuguese FCT, and by Belgacom.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253–284, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Alur, C. Courcoubetis, and D.L. Dill. Model checking in dense real time. Information and Computation, 104(1):2–34, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Alur, T. Feder, and T.A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116–146, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  8. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finitestate concurrent systems using temporal-logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.

    Article  MATH  Google Scholar 

  9. E. Harel, O. Lichtenstein, and A. Pnueli. Explicit-clock temporal logic. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 402–413. IEEE Computer Society Press, 1990.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  13. Ron Koymans. Specifying message passing and time-critical systems with temporal logic. LNCS 651, Springer-Verlag, 1992.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  17. J.S. Ostroff. Temporal Logic of Real-time Systems. Research Studies Press, 1990.

    Google Scholar 

  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.

    Google Scholar 

  19. P. Wolper. Synthesis of Communicating Processes from Temporal-Logic Specifications. PhD thesis, Stanford University, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Institute, University of Namur, Belgium

    J. -F. Raskin & P. -Y. Schobbens

  2. Electrical Engineering and Computer Sciences, University of California, Berkeley

    T. A. Henzinger

Authors
  1. J. -F. Raskin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. -Y. Schobbens
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. A. Henzinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Davide Sangiorgi Robert de Simone

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raskin, J.F., Schobbens, P.Y., Henzinger, T.A. (1998). Axioms for real-time logics. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055625

Download citation

  • DOI: https://doi.org/10.1007/BFb0055625

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64896-3

  • Online ISBN: 978-3-540-68455-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation