Advertisement

Formal Methods in System Design

, Volume 1, Issue 4, pp 385–415 | Cite as

Minimum and maximum delay problems in real-time systems

  • Costas Courcoubetis
  • Mihalis Yannakakis
Article

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?

Keywords

finite-state system timers verification reachability analysis shortest path 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [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.Google Scholar
  3. [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. [4]
    R. Alur and T. Henzinger. A really temporal logic.Proc. 30th Annual IEEE Symposium on Foundations of Computer Science, pp. 164–169, 1989.Google Scholar
  5. [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.Google Scholar
  6. [6]
    H. Lewis, A logic of concrete time intervals.Proc. 5th IEEE Symp. on Logic in Computer Science, pp. 380–389, 1990.Google Scholar
  7. [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.Google Scholar
  8. [8]
    T.H.Corman, C.E.Leiserson, and R.L.Rivest.Introduction to Algorithms, McGraw Hill, New York, 1990.Google Scholar
  9. [9]
    M. Fredman and R.E. Tarjan. Fibonacci heaps and their uses in improved network.Google Scholar

Copyright information

© Kluwer Academic Publishers 1992

Authors and Affiliations

  • Costas Courcoubetis
    • 1
  • Mihalis Yannakakis
    • 2
  1. 1.Computer Science Institute, Forth, and Computer Science DepartmentUniversity of CreteUSA
  2. 2.AT&T Bell LaboratoriesMurray Hill

Personalised recommendations