Real-Time Logic Revisited

  • Authors:
  • Stephen Paynter

  • Affiliations:
  • -

  • Venue:
  • FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper redefines RTL within classical many-sorted logic with natural number and real arithmetic. In doing so, RTL is generalised in a number of ways. In particular, functionality is handled through the use of timed variables. Various models of time for RTL are discussed, and it is argued that, providing events satisfy a countable occurrence property, time in RTL can be continuous. A number of useful RTL theorems are stated, and it is shown that RTL can naturally express all the usual temporal requirements that are placed on real-time systems. RTL is compared with other timed logics.