| | |
Summary: The Benefits of Relaxing Punctuality 1
Rajeev Alur
AT&T Bell Laboratories
Murray Hill, NJ 07974
Email: alur@research.att.com
Tom'as Feder
IBM Almaden Research Center
San Jose, CA 95120
Email: tomas@almaden.ibm.com
Thomas A. Henzinger 2
Computer Science Department, Cornell University
Ithaca, NY 14853
Email: tah@cs.cornell.edu
Abstract. The most natural, compositional, way of modeling realtime 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. We introduce
a temporal language that can constrain the time difference between events only with
finite, yet arbitrary, precision and show the resulting logic to be EXPSPACEcomplete.
This result allows us to develop an algorithm for the verification of timing properties of
realtime systems with a dense semantics.
|