Steven Bradley

Learn More
Existing formal methods for real-time largely deal with abstract models of real-time systems, and seldom address implementation issues; they are mainly used for modelling and speciication. In this paper we propose an alternative approach, in which a new timed process algebra, AORTA, is used as a design language, which can be veriiably implemented. As well(More)
In order to demonstrably satisfy hard real-time deadlines, a system must be predictable, and in particular the kernel must be predictable. In this paper we present and analyse a predictable kernel related to AORTA, a formal design language for hard real-time systems. The features of the kernel allow AORTA designs to be veriiably and semi-automatically(More)
AORTA is an implementable timed process algebra which has been proposed as a design language for hard real-time systems. In this paper we show how AORTA can be used to design and model timed protocols, illustrated by the alternating bit protocol. We also describe tools which have been developed for simulation, veriication and automatic implementation of(More)
This paper tackles the problem of using formal methods for practical real-time system development and ver-iication, and is based on a real example. Many formal methods for real-time systems have been proposed, but this technique (AORTA) is one of the few to address the issue of how formal designs are to be implemented. Earlier papers on AORTA have been(More)
BACKGROUND Cardiac troponin assays have improved the ability to detect myocardial damage. However, ascertaining whether troponin elevation is due to myocardial infarction (MI) or secondary to another process can be challenging. Our aim is to evaluate provider-level variation in the diagnosis of MI and the use of invasive coronary angiography (ICA) among(More)
The latest planners and schedulers allow expressive domain modelling and problem definition, particularly with respect to the inclusion of constrained resource usage and inter-task dependencies. This increased complexity removes the ability to guarantee schedulability of a problem at run-time.In hard real-time systems, where 'hard' emphasizes the critical(More)