The benefits of relaxing punctuality

The most natural, compositional, way of modeling real-time systems uses a dense domain for time. The satisfiability of timing constraints that are capable of expressing punctuality in this model, however, is known to be undecidable. A temporal language is introduced that can constrain the time difference between events only with finite, yet arbitrary, precision and show the resulting logic to be EXSPACE-complete. This result allows an algorithm to be developed for the verification of timing properties of real-time systems with a dense semantics.