Skip to main content

What good are digital clocks?

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1992)

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

Included in the following conference series:

Abstract

Real-time systems operate in “real,” continuous time and state changes may occur at any real-numbered time point. Yet many verification methods are based on the assumption that states are observed at integer time points only. What can we conclude if a real-time system has been shown “correct” for integral observations?

Integer time verification techniques suffice if the problem of whether all real-numbered behaviors of a system satisfy a property can be reduced to the question of whether the integral observations satisfy a (possibly modified) property. We show that this reduction is possible for a large and important class of systems and properties: the class of systems includes all systems that can be modeled as timed transition systems; the class of properties includes time-bounded invariance and time-bounded response.

A full version of this paper (including all proofs) is available as a technical report from Cornell University and Stanford University. The research was supported in part by the National Science Foundation under grants CCR-89-11512 and CCR-89-13641, by the Defense Advanced Research Projects Agency under contract NAG2-703, by the United States Air Force Office of Scientific Research under contract AFOSR-90-0057, and by the European Community ESPRIT Basic Research Action Project 3096 (SPEC).

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alur, R., And Dill, D. Automata for modeling real-time systems. In ICALP 90: Automata, Languages, and Programming, M. Paterson, Ed., Lecture Notes in Computer Science 443. Springer-Verlag, 1990, pp. 322–335.

    Google Scholar 

  2. Alur, R., Feder, T., And Hunzinger, T. The benefits of relaxing punctuality. In Proceedings of the Tenth Annual Symposium on Principles of Distributed Computing (1991), ACM Press, pp. 139–152.

    Google Scholar 

  3. Alur, R., And Henzinger, T. A really temporal logic. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989), IEEE Computer Society Press, pp. 164–169.

    Google Scholar 

  4. Alur, R., And Henzinger, T. Real-time logics: complexity and expressiveness. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science (1990), IEEE Computer Society Press, pp. 390–401.

    Google Scholar 

  5. Alur, R., And Henzinger, T. Logics and models of real time: A survey. In Real Time: Theory in Practice, J. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, Eds., Lecture Notes in Computer Science 600. Springer-Verlag, 1992.

    Google Scholar 

  6. Barringer, H., Kuiper, R., And Pnueli, A. A really abstract concurrent model and its temporal logic. In Proceedings of the 13th Annual Symposium on Principles of Programming Languages (1986), ACM Press, pp. 173–183.

    Google Scholar 

  7. Berry, G., And Cosserat, L. The Esterel synchronous programming language and its mathematical semantics. In CMU Seminar on Concurrency, Lecture Notes in Computer Science 197. Springer-Verlag, 1985.

    Google Scholar 

  8. Burch, J. Approximating continuous time. Presented at the IEEE Computer Society Workshop on VLSI, Orlando, Florida, 1991.

    Google Scholar 

  9. Caspi, P., Pilaud, D., Halbwachs, N., And Plaice, J. Lustre: a declarative language for programming synchronous systems. In Proceedings of the 14th Annual Symposium on Principles of Programming Languages (1987), ACM Press.

    Google Scholar 

  10. De Barker, J., Huizing, K., De Roever, W.-P., And Rozenberg, G., Eds. Real Time: Theory in Practice. Lecture Notes in Computer Science 600. Springer-Verlag, 1992.

    Google Scholar 

  11. Emerson, E., Mok, A., Sistla, A., And Srinivasan, J. Quantitative temporal reasoning. Presented at the First Annual Workshop on Computer-aided Verification, Grenoble, France, 1989.

    Google Scholar 

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

    Google Scholar 

  13. Henzinger, T. Half-order modal logic: how to prove real-time properties. In Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing (1990), ACM Press, pp. 281–296.

    Google Scholar 

  14. Henzinger, T. The Temporal Specification and Verification of Real-time Systems. PhD thesis, Stanford University, 1991.

    Google Scholar 

  15. Henzinger, T., Manna, Z., And Pnueli, A. Temporal proof methodologies for real-time systems. In Proceedings of the 18th Annual Symposium on Principles of Programming Languages (1991), ACM Press, pp. 353–366.

    Google Scholar 

  16. Henzinger, T., Manna, Z., And Pnueli, A. Timed transition systems. In Real Time: Theory in Practice, J. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, Eds., Lecture Notes in Computer Science 600. Springer-Verlag, 1992.

    Google Scholar 

  17. Jahanian, F., And Mok, A. Safety analysis of timing properties in real-time systems. IEEE Transactions on Software Engineering SE-12, 9 (1986), 890–904.

    Google Scholar 

  18. Keller, R. Formal verification of parallel programs. Communications of the ACM 19, 7 (1976), 371–384.

    Article  Google Scholar 

  19. Koymans, R. Specifying real-time properties with metric temporal logic. Real-time Systems 2, 4 (1990), 255–299.

    Google Scholar 

  20. Lynch, N., And Attiya, H. Using mappings to prove timing properties. In Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing (1990), ACM Press, pp. 265–280.

    Google Scholar 

  21. Maler, O., Manna, Z., And Pnueli, A. A formal approach to hybrid systems. In Real Time: Theory in Practice, J. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, Eds., Lecture Notes in Computer Science 600. Springer-Verlag, 1992.

    Google Scholar 

  22. Manna, Z., And Pnueli, A. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1992.

    Google Scholar 

  23. Merritt, M., Modugno, F., And Tuttle, M. Time-constrained automata. In CONCUR 91: Theories of Concurrency, Lecture Notes in Computer Science. Springer-Verlag, 1991.

    Google Scholar 

  24. Nicollin, X., Richier, J.-L., Sifakis, J., and Voiron, J. ATP: an algebra for timed processes. In Proceedings of the IFIP WG2.2/2.3 Working Conference on Programming Concepts and Methods (1990), M. Broy and C. Jones, Eds., Elsevier Science Publishers (North-Holland), pp. 415–442.

    Google Scholar 

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

    Google Scholar 

  26. Pnueli, A. The temporal logic of programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science (1977), IEEE Computer Society Press, pp. 46–57.

    Google Scholar 

  27. Pnueli, A., And Harel, E. Applications of temporal logic to the specification of real-time systems. In Formal Techniques in Real-time and Fault-tolerant Systems, M. Joseph, Ed., Lecture Notes in Computer Science 331. Springer-Verlag, 1988, pp. 84–98.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

W. Kuich

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Henzinger, T.A., Manna, Z., Pnueli, A. (1992). What good are digital clocks?. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_103

Download citation

  • DOI: https://doi.org/10.1007/3-540-55719-9_103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55719-7

  • Online ISBN: 978-3-540-47278-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics