Computing accumulated delays in real-time systems

  • Rajeev Alur
  • Costas Courcoubetis
  • Thomas A. Henzinger
Conference paper

DOI: 10.1007/3-540-56922-7_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 697)
Cite this paper as:
Alur R., Courcoubetis C., Henzinger T.A. (1993) Computing accumulated delays in real-time systems. In: Courcoubetis C. (eds) Computer Aided Verification. CAV 1993. Lecture Notes in Computer Science, vol 697. Springer, Berlin, Heidelberg


We present a verification algorithm for duration properties of finite-state real-time systems. While simple real-time properties constrain the total elapsed time between events, duration properties constrain the accumulated time during which certain state predicates hold. We formalize the concept of durations by introducing duration measures for (dense-time) timed automata. Given a timed automaton with a duration measure, a start and a target state, and a duration constraint, the duration-bounded reachability problem asks if there is a run of the automaton from the start state to the target state such that the accumulated duration along the run satisfies the constraint. Our main result is a novel decision procedure for solving the duration-bounded reachability problem. We also prove that the problem is PSPACE-complete and demonstrate how the solution can be used to verify interesting duration properties of real-time systems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Rajeev Alur
    • 1
  • Costas Courcoubetis
    • 2
  • Thomas A. Henzinger
    • 3
  1. 1.AT&T Bell LaboratoriesMurray Hill
  2. 2.Department of Computer ScienceUniversity of CreteGreece
  3. 3.Department of Computer ScienceCornell UniversityIthaca

Personalised recommendations