Papers published in 1992 | Real-Time Systems Group

Absolute and Relative Temporal Constraints in Hard Real-Time Database
N. C. Audsley, A. Burns, M. F. Richardson and A. J. Wellings

Allocating Real-Time Tasks (An NP-Hard Problem made Easy)
K. Tindell, A. Burns and A.J. Wellings

An Extendible Approach for Analysing Fixed Priority Hard Real-Time Tasks
K. Tindell

Applying New Scheduling Theory to Static Priority Pre-emptive Scheduling
N. Audsley, A. Burns, M. Richardson, K. Tindell and A. Wellings

Deadline Monotonic Scheduling Theory
N.C. Audsley, A. Burns, M.F. Richardson and A.J. Wellings

Designing Hard Real-time Systems
A. Burns and A.J. Wellings

Hard Real-Time Scheduling: The Deadline Monotonic Approach
N. C. Audsley, A. Burns, M. F. Richardson and A. J. Wellings

Hard Real-time HOOD: A Design Method for Hard Real-time Ada 9X Systems
A. Burns and A.J. Wellings

Implementing Hard Real-time Systems: A Case Study
C.M. Bailey, A. Burns, E. Fyfe, F. Gomez-Molinero and A.J. Wellings

In Support of the Ada 9X Real-Time Facilities
A. Burns and A.J. Wellings

Incorporating Unbounded Algorithms Into Predictable Real-Time Systems
N. C. Audsley, A. Burns, M. F. Richardson and A. J. Wellings

Incorporating Unbounded Algorithms into Predictable Real-Time Systems
N. C. Audsley, A. Burns, M. F. Richardson and A. J. Wellings

Mode Changes in Priority Pre-emptive Scheduled Systems
K. Tindell, A. Burns and A. Wellings

Safety Kernels and the Ada Programming Language
A. Burns and A.J. Wellings

TAM: A Formal Framework for the Development of Distributed Real-Time Systems
D. J. Scholefield and H.S.M. Zedan

The Refinement of Real-Time Systems
D.J. Scholefield and H.S.M. Zedan

Towards Ada 9X
A. Burns

Unbounded Algorithms, Predictable Real-Time Systems and Ada9X
N. C. Audsley, A. Burns and A.J. Wellings

Using Offset Information to Analyse Static Priority Pre-Emptively Scheduled Task Sets
K. Tindell

Weakest Precondition Semantics for Time and Concurrency
D.J. Scholefield and H.S.M. Zedan