Skip to main content
SpringerLink
Log in

Decidability and undecidability results for duration calculus

  • Conference paper
  • First Online:
STACS 93 (STACS 1993)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and T.A. Henzinger: A Really Temporal Logic. In 30th Annual IEEE Symp. on Foundations of Computer Science, October 1989, pp. 164–169.

    Google Scholar 

  2. R. Alur, C. Courcoubetis, and D. Dill: Model-Checking for Real-Time Systems. In Fifth Annual IEEE Symp. on Logic in Computer Science, 1990, pp. 414–425.

    Google Scholar 

  3. R. Bird. Programs and Machines. John Wiley & Sons, 1976.

    Google Scholar 

  4. N.S. Bjørner: On Formally Undecidable Propositions of Duration Calculus, Personal note, Dept. of Comp. Science, Technical University of Denmark, April 15, 1992.

    Google Scholar 

  5. Zhou Chaochen, C.A.R. Hoare, and A.P. Ravn: A Calculus of Durations. In Information Processing Letters 40(5), 1991, pp. 269–276.

    Google Scholar 

  6. J. Halpern, B. Moszkowski, and Z. Manna: A Hardware Semantics Based on Temporal Intervals. In ICALP'83, LNCS 154, Springer-Verlag 1983, pp. 278–291.

    Google Scholar 

  7. M.R. Hansen and Zhou Chaochen: Semantics and Completeness of Duration Calculus. In J.W. deBakker, K. Huizing, W.P. de Roever, and G. Rozenberg (eds.): Real-Time: Theory in Practice, 1991, LNCS 600, Springer-Verlag 1992, pp. 209–225.

    Google Scholar 

  8. M.R. Hansen, Zhou Chaochen, and J. Staunstrup: A Real-Time Duration Semantics for Circuits. In TAU 1992 ACM/SIGDA Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, Princeton Univ., NJ, March 1992.

    Google Scholar 

  9. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

    Google Scholar 

  10. A.P. Ravn, H. Rischel, and K.M. Hansen: Specifying and Verifying Requirements of Real-Time Systems. IEEE Transactions on Software Engineering. (To appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UNU/IIST, Apartado, 3058, Macau

    Zhou Chaochen

  2. Fachbereich Informatik, Universität Oldenburg, Germany

    Michael R. Hansen

  3. Department of Computer Science, Technical University of Denmark, DK-2800, Lyngby

    Peter Sestoft

Authors
  1. Zhou Chaochen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael R. Hansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Sestoft
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Enjalbert A. Finkel K. W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chaochen, Z., Hansen, M.R., Sestoft, P. (1993). Decidability and undecidability results for duration calculus. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-56503-5_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56503-1

  • Online ISBN: 978-3-540-47574-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation