We show how real-time schedulability tests and program refinement rules can be integrated to create a formal development method of practical use to real-time programmers. A computational model for representing task scheduling is developed within a 'timed’ refinement calculus. Proven multi-tasking schedulability tests then become available as feasibility checks during system refinement.
CITATION STYLE
Fidge, C., Utting, M., Kearney, P., & Hayes, I. (1996). Integrating real-time scheduling theory and program refinement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1051, pp. 327–346). Springer Verlag. https://doi.org/10.1007/3-540-60973-3_95
Mendeley helps you to discover research relevant for your work.