An Abstract Model for Scheduling Real-Time Programs

Authors:
Alvaro E. Arenas
Affiliations:
-
Venue:
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Year:
2002

Citing 1
Cited 2

Verification, refinement and scheduling of real-time programs

Theoretical Computer Science - Special issue on real-time systems and concurrent and distributed software

Applying Unifying Theories Of Programming To Real-Time Programming

Journal of Integrated Design & Process Science - Applications of formal methods
Towards Modelling Obligations in Event-B

ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main contribution of this paper is to devise a technique that allows one to study the implementation of the same program under different schedulers using high-level abstractions such as algebraic laws and simple methods. We apply the techniques presented in Hoare and He's Unifying Theories of Programming in order to develop an abstract model for scheduling real-time programs into a uniprocessor machine. We illustrate the applicability of the model by instancing it with two types of schedulers: a round-robin scheduler, employed when the participating parallel processes do not include deadline constraints, and a priority-based scheduler, used when each participating process is periodic and possesses an associated deadline.