Abstract
Assume that a real-time programP T consisting of a number of parallel processes is executed on a system having a setPr of processors which are shared between the processes by a real-time schedulerS T. Assume that PT must meet some timing deadlines. We show that such an implementation ofP T can be represented as a transformationL(P T) and that the deadlines ofP T will be met if they are satisfied by the timing properties of the transformed program. The condition for feasibility of a real-time program executed under a scheduler is formalized and rules are provided for verification. The schedulerS T can be specifiedgenerically and applied to different programs, making it unnecessary to introduce low-level operations such as scheduling primitives into the programming language. Thus real-time program specification and Schedulability can be considered in the same framework and the timing properties of a program can be determined at the specification level. By separating the specification of the scheduler from that of the program, the feasibility of an implementation can be proved by considering a scheduling policy rather than its implementation details.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Audsley, N., Burns, A., Richardson, M., Tindell, K. and Wellings, A.: Applying new scheduling theory to static priority pre-emptive scheduling. Technical Report RTRG/92/120, Department of Computer Science, University of York, 1992.
Abadi, M. and Lamport, L.: The existence of refinement mappings.Theoretical Computer Science, 82(2), May 1991.
Abadi, M. and Lamport, L.: An old-fashioned recipe for real-time. In W.R. de Rover J.W. de Bakker, C. Huizing and G. Rozenberg, editors,Real-Time: Theory in Practice, Lecture Notes in Computer Science 600. Springer-Verlag, 1991.
Henzinger, T., Manna, Z. and Pnueli, A.: Temporal proof methodologies for real-time systems. InProceedings of the 8th ACM Annual Symposium on Principles of Programming Languages, pages 269–276, 1991.
Hooman, J.: A denotational real-time semantics for shared processors. InPARLE'91 Parallel Architectures and Languages Europe, Vol. II, Lecture Notes in Computer Science 506, pages 185–201. Springer-Verlag, 1991.
Lamport, L.: A temporal logic of actions. Technical report, Digital SRC, California, April 1990.
Liu, Z. and Joseph, M.: Specification and verification of recovery in asynchronous communicating systems. In J. Vytopil, editor,Formal Techniques in Real-Time and Fault Tolerant Systems, pages 137–166. Kluwer Academic Publishers, 1993.
Liu, Z. and Joseph, M.: Stepwise development of fault-tolerant reactive systems. In H. Langmaak, W.-P. de Roever, and J. Vytopil, editors,Formal Techniques in Real-Time and Fault Tolerant Systems, Lecture Notes in Computer Science 863, pages 529–546. Springer-Verlag, 1994.
Zhou, C.C., Hoare, C.A.R. and Ravn, A.P.: A calculus of durations.Information Processing Letters, 40(5), December 1991.
Zhou, C.C. Hansen, M.R. Ravn, A.P. and Rischel, H.: Duration specifications for shared processors. In J. Vytopil, editor,Formal Techniques in Real-Time and Fault-Tolerant Systems, Lecture Notes in Computer Science 571. Springer-Verlag, January 1992.
Zhang Y. and Zhou, C.C.: A formal proof of the deadline driven scheduler. In H. Langmaak, W.-P. de Roever, and J. Vytopil, editors,Formal Techniques in Real-Time and Fault Tolerant Systems, Lecture Notes in Computer Science 863, pages 756–775. Springer-Verlag, 1994.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, Z., Joseph, M. & Janowski, T. Verification of schedulability for real-time programs. Formal Aspects of Computing 7, 510–532 (1995). https://doi.org/10.1007/BF01211630
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01211630