The benefits of relaxing punctuality

The most natural, compositional, way of modeling real-time systems uses a dense domain for time. The satistiability 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 EXPSPACE-complete. This result allows us to develop an algorithm for the verification of timing properties of real-time systems with a dense semantics. Categories and Subject Descriptors: C.3 (Special-Purpose and Application-Based Systems)--real- time systems; D.2.1 (Software Engineeriogk Requirements/Specifications-languages; F.3.1 (Lugics and Meanings of ~rugmms): Specifying and Verifying and Reasoning about Programs-lo& of programs; mechanical verification; specification techniques; F.4.3 (Mathematical Logic and Formal Languages): Formal Languages-classes f decision problems

[1]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[2]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[3]  Amir Pnueli,et al.  Explicit clock temporal logic , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[4]  A. Prasad Sistla,et al.  Quantitative Temporal Reasoning , 1990, CAV.

[5]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[6]  Amir Pnueli,et al.  Propositional Dynamic Logic of Nonregular Programs , 1983, J. Comput. Syst. Sci..

[7]  Thomas A. Henzinger,et al.  Logics and Models of Real Time: A Survey , 1991, REX Workshop.

[8]  Jr. Hartley Rogers Theory of Recursive Functions and Effective Computability , 1969 .

[9]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[10]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[11]  Jonathan S. Ostroff,et al.  Temporal logic for real-time systems , 1989 .

[12]  Harry R. Lewis,et al.  A logic of concrete time intervals , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[13]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[14]  Thomas A. Henzinger,et al.  Real-time logics: complexity and expressiveness , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.