Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

Real-Time Logic Revisited

Lookup NU author(s): Dr Stephen Paynter

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

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.

Publication metadata

Author(s): Paynter SE

Editor(s): Oliveira, J.N., Zave, P.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: FME 2001: Formal Methods for Increasing Software Productivity

Year of Conference: 2001

Pages: 300-317

ISSN: 0302-9743

Publisher: Springer

URL: http://dx.doi.org/10.1007/3-540-45251-6_17

DOI: 10.1007/3-540-45251-6_17

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783540417910

Share