Minimum and maximum delay problems in realtime systems
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?
Unable to display preview. Download preview PDF.
- [ACD90]R. Alur, C. Courcoubetis, D. Dill, “Model-Checking for Real-Time Systems”, 5th IEEE LICS, 1990.Google Scholar
- [ACD91]R. Alur, C. Courcoubetis, D. Dill, “Probabilistic Model Checking of Real-Time Systems”, to appear in 18th ICALP, 1991.Google Scholar
- [AD90]R. Alur, D. Dill, “Automata for Modelling Real-Time Systems”, 17th ICALP, 1990.Google Scholar
- [AH89]R. Alur, T. Henzinger, “A Really Temporal Logic”, 30th IEEE FOCS, 1989.Google Scholar
- [AK83]S. Aggarwal, R. Kurshan, “Modelling Elapsed Time in Protocol Specification”, Protocol Specification, Testing and Verification, III, 1983.Google Scholar
- [Di89]D. Dill, “Timing Assumptions and Verification of Finite-State Concurrent Systems”, Automatic Verification Methods for Finite-State Systems, LNCS 407, 1989.Google Scholar
- [Le90]H. Lewis, “A Logic of Concrete Time Intervals”, 5th IEEE LICS, 1990.Google Scholar