Abstract
Ada 9X mapping proposals revise Ada83 and introduce several novel concepts for programming real-time systems. Dynamic priorities of tasks and a family of priority models are critical elements in this revision. Because of dynamic priorities, observing task preemption becomes necessary. When processors have local clocks, this becomes an important technical and correctness issue. In this paper, we consider a small rendezvous based subset derived from Ada 9X mapping proposals and give limited parallelism semantic models for the subset language. From an unconstrained semantic model, we develop a simple priority model, and the simple priority+83 model. The simple priority+83 model is a submodel of the core priority model of Ada 9X mapping proposals.
The author is partially funded under the contract number F8635-90-C-0308 from the Eglin Airforce Base. The Office of Naval Research under the grant number N00014-89-J-1171 funded the author's work on real-time system specification and verification. Any findings and opinions contained in this paper are those of the author and not of the Department of Defense.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
“The Programming Language Ada Reference Manual,” Lecture Notes in Comput. Sci. 155, Springer-Verlag, Berlin (1983).
“Ada 9X Mapping Document: Mapping Specification,” Draft Ada 9X Project Report, Office of the Undersecretary of Defense Acquisition, Washington DC (Aug 1991).
Francez, N., Lehman, D., and Pnueli, A.: “A Linear-history Semantics for Languages for Distributed Programming,” Theoret. Comput. Sci. 32, 25–46 (1984).
Gerth,R.T., de Reover, W.P.: “A Proof System for Concurrent Ada Programs,” Science of Computer Programming, pp. 159–204 (1984).
Henzinger,T.A.: “Temporal Specification and Verification of Real-Time Systems,” Ph. D Thesis, Stanford University (1991).
Hooman, J.: “A Denotational Real-Time Semantics for Shared Processors,” Lecture Notes in Comp. Sci., 506, pp. 184–201 (1991).
Huizing, C., Gerth R., de Roever, W.P.: “Full Abstraction of a Real-Time Denotational Semantics for an OCCAM-like Language,” Proc. 14th ACM Symposium on Principles of Programming Languages, 223–238 (1987).
Koymans, R., Shyamasundar, R.K., de Roever, W.P., Gerth, R., and Arun-Kumar, S.: “Compositional Denotational Semantics for Real-time Distributed Computing,” Information and Control 79 (3), 210–256 (1988).
Milner, R.: “Calculi for Synchrony and Asynchrony,” Theoretical Computer Science 25, 267–310 (1983).
Narayana,K.T.: “Observing Task Preemption in Ada 9X,” ORA Research Report (June 1991).
Reed, G.M., and Roscoe, A.W.: “A Timed Model for Communicating Sequential Processes,” Lecture Notes in Comput. Sci. 226, 314–323 (1986).
Shade, E.: “Concepts and Models for Real-Time Concurrency Under Limited Parallelism,” Ph.D Thesis, Department of Computer Science, Whitmore Laboratory, The Pennsylvania State University, University Park, Pa16802 (June 1991).
Shade, E., Narayana, K.T.: “Real-Time Semantics for Shared-variable Concurrency,” Information and Computation, In Press (1991(2?)).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Narayana, K.T. (1991). Observing task preemption in Ada 9X. In: Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1992. Lecture Notes in Computer Science, vol 571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55092-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-55092-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55092-1
Online ISBN: 978-3-540-46692-5
eBook Packages: Springer Book Archive