Papers published in 1994 | Real-Time Systems Group

A Specification Oriented Semantics for Real-Time Systems
D. J. Scholefield, H. S. M. Zedan and J. He

A Study of Timing Properties with the Timed Token Protocol
S. Zhang and A. Burns

Adapting and evaluating algorithms for dynamic schedulatility testing
C. McElhone

Adding Time-Offsets To Schedulability Analysis
K. Tindell

Allocation of Safety Critical Hard Real-Time Tasks on a Parallel Platform
M. Nicholson, A. Burns, K. Tindell and N. Zhang

An Extendible Approach for Analysing Fixed Priority Hard Real-Time Tasks
K. Tindell, A. Burns and A.J. Wellings

Analysing High-Integrity Systems
J.A. Clark, J.A. McDermid and A. Burns

Analysing Real-Time Communications: Controller Area Network (CAN)
K.W. Tindell, H. Hansson and A.J. Wellings

Analysis and Design Synthesis for Hard Real-Time Safety Critical Systems
M. Nicholson, J.A. McDermid and A. Burns

Analysis of Hard Real-Time Communications
K. Tindell

Appropriate Machanisms for the Support of Optional Processing in Hard Real-Time Systems
N.C. Audsley, A. Burns, R.I. Davis and A.J. Wellings

Calculating Controller Area Network (CAN) Message Response Times
K. Tindell, A. Burns and A.J. Wellings

Dependable Software Systems Using Concurrency
A. Burns, A.J. Wellings, A.D. Hutcheon and R.H. Pierce

Dual Priority Scheduling: A Means of Providing Flexibility in Hard Real-Time Systems
R.I. Davis

EMCA - An Optimal Synchronous Bandwith Allocation Scheme for Guaranteeing Synchronous Message Deadlines With The Timed Token Protocol in a FDDI Network
S. Zhang and A. Burns

Fixed Priority Scheduling of Hard Real-Time Multi-Media Disk Traffic
K. Tindell and A. Burns

Fixed Priority Scheduling with Deadlines Prior to Completion
A. Burns, K. Tindell and A.J. Wellings

Guaranteed Messsage Latencies for Distributed Safety-Critical Hard Real-Time Control Networks
K. Tindell and A. Burns

Guaranteeing Message Latencies on Controller Area Network (CAN)
K. Tindell and A. Burns

Guaranteeing X in Y: On-line Acceptance Tests for Hard Aperiodic tasks Scheduled by the Slack Stealing Algorithm
R.I. Davis

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

Holistic Schedulability Analysis for Distributed Hard Real-Time Systems
K. Tindell and J. Clark

Hybrid Algorithms For Dynamic Schedulability Testing
C. McElhone

Implementing Analysable Hard Real-Time Sporadic Tasks in Ada 9X
A. Burns and A.J. Wellings

Integrated Program Proof and Timing Analysis of SPARK Ada
R. Chapman, A. Burns and A.J. Wellings

Integrating Best Effort and Fixed Priority Scheduling
N. Audsley, A. Burns, R.I. Davis and A.J. Wellings

Integrating Best-Effort Policies into Hard Real-Time Systems based on Fixed Priority
R.I. Davies

Integrating Best-Effort Policies into Hard Real-Time Systems based on Fixed Priority Pre-emptive Scheduling
R.I. Davis

Mechanisms for Enhancing the Flexibility and Utility of Hard Real-Time Systems
N.C. Audsley, R.I. Davis and A. Burns

Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-emptive Systems
R.I. Davis and A. Burns

Performance Analysis of a Hard Real-Time System
A. Burns, A.J. Wellings, C.H. Forsyth and C.M. Bailey

Preemptive Priority Based Scheduling: An Appropriate Engineering Approach
A. Burns

Real-Time Safety Critical Systems: Analysis and Synthesis
A. Burns and J.A. McDermid

Static Worst-Case Timing Analysis of Ada
R. Chapman, A. Burns and A.J. Wellings

Stress: A Simulator for Hard Real-Time Systems
N.C. Audsley, A. Burns, M.F. Richardson and A.J. Wellings

Supporting Distribution and Dynamic Reconfiguration in AdaPT
A.B. Gargaro, S.J. Goldsack, A.A. Holzbacher-Valero, R. Volz, R. Waldrop and A.J. Wellings

Synchronisation, Concurrent Object-Oriented Programming and the Inheritance Anomaly
S. Mitchell and A.J. Wellings

Tao: A Model for Concurrency in Object-Oriented Programming
S. Mitchell and A.J. Wellings

The Satisfaction of PLC Timing Constraints
J. Clark and K. Tindell

Timing Properties of the Timed Token Protocol
S. Zhang and A. Burns

Worst-Case Timing Analysis via Finding Longest Paths in SPARK Ada Basic-Path Graphs
R. Chapman