Skip to main content
SpringerLink
Log in

Minimum and maximum delay problems in real-time systems

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

We consider a finite-state system with a finite number of clocks, where the transitions may depend on the values of the clocks, and may reset some of the clocks. We address the complexity and provide algorithms for the following problems. Suppose that the system starts from a given current state with a given assignment of values to the clocks. Can a given target state ever appear in the history of the system? What is the earliest time it can appear? What is the latest time it can appear?

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S.Aggarwal and R.Kurshan, Modeling elapsed time in protocol specification,Proc. Protocol Specification, Testing and Verification, 3: 51–62, 1983.

    Google Scholar 

  2. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems.Proc. 5th IEEE Symposium on Logic in Computer Science, pp. 414–425, 1990.

  3. R.Alur and D.Dill. Automata for modeling real-time systems.Proc. 17th International Collaboration on Automata, Languages and Programming. Lecture Notes in Computer Science, 443: 322–335, 1990.

    Google Scholar 

  4. R. Alur and T. Henzinger. A really temporal logic.Proc. 30th Annual IEEE Symposium on Foundations of Computer Science, pp. 164–169, 1989.

  5. D. Dill. Timing assumptions and verification of finite-state concurrent systems.Automatic Verification Methods for Finite-State Systems. Lecture Notes in Computer Science, 407:,1989.

  6. H. Lewis, A logic of concrete time intervals.Proc. 5th IEEE Symp. on Logic in Computer Science, pp. 380–389, 1990.

  7. R. Alur, C. Courcoubetis, and D. Dill. Probabilistic model checking of real-time systems.Proc. 18th International Collaboration on Automata, Languages and Programming. Lecture Notes in Computer Science, 510: 1991.

  8. T.H.Corman, C.E.Leiserson, and R.L.Rivest.Introduction to Algorithms, McGraw Hill, New York, 1990.

    Google Scholar 

  9. M. Fredman and R.E. Tarjan. Fibonacci heaps and their uses in improved network.

Download references

Author information

Authors and Affiliations

  1. Computer Science Institute, Forth, and Computer Science Department, University of Crete, USA

    Costas Courcoubetis

  2. AT&T Bell Laboratories, 07974, Murray Hill, NJ

    Mihalis Yannakakis

Authors
  1. Costas Courcoubetis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mihalis Yannakakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Courcoubetis, C., Yannakakis, M. Minimum and maximum delay problems in real-time systems. Form Method Syst Des 1, 385–415 (1992). https://doi.org/10.1007/BF00709157

Download citation

  • Issue Date:

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

Keywords

Search

Navigation