Chapter 14 – Formal description of realtime systems: A reiew

Publisher Summary This chapter discusses the formal description of realtime systems. The verification of realtime properties involves determining the time of completion of actions in the program, and this in turn may depend on the availability of computing resources. It is found that if the resources can be assumed to place no restriction on the computations, such as, if the amount of time needed for processing can be disregarded, a relatively simple synchronous language model, like that of SIGNAL3, can be used in which each computation takes place as soon as it is needed, and the problem of resource allocation then becomes trivial. It is found that if, on the other hand, resources are limited, the time needed for a computation can depend on the availability of resources, and a more complex language model is needed to represent the allocation of resources to computations. Resource scheduling is also related to what is called the performance of a program, which is usually a relatively high-level description of its realtime behavior on some particular architecture. Program performance can be studied analytically, or by measuring the actual performance during an execution.

[1]  Nicolas Halbwachs,et al.  LUSTRE: a declarative language for real-time programming , 1987, POPL '87.

[2]  K. Mani Chandy,et al.  Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

[3]  Tomasz Müldner,et al.  On the Algorithmic Properties of Concurrent Programs , 1979, Logic of Programs.

[4]  Dennis W. Leinbaugh.  Guaranteed Response Times in a Hard-Real-Time Environment , 1980, IEEE Transactions on Software Engineering.

[5]  C. A. R. Hoare,et al.  Monitors: an operating system structuring concept , 1974, CACM.

[6]  Ben Wegbreit,et al.  Verifying Program Performance , 1976, JACM.

[7]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[8]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, ICALP.

[9]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[10]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[11]  Volkmar H. Haase,et al.  Real-Time Behavior of Programs , 1981, IEEE Transactions on Software Engineering.

[12]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[13]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[14]  Willem P. de Roever,et al.  Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem , 1985, ICALP.

[15]  Willem P. de Roever,et al.  Compositional Semantics for Real-time Distributed Computing , 1985, Logic of Programs.

[16]  J Job Zwiers.  Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes and Their Relationship , 1989 .

[17]  Willem P. de Roever,et al.  Full abstraction of a real-time denotational semantics for an OCCAM-like language , 1987, POPL '87.

[18]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..

[19]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[20]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[21]  Krithi Ramamritham,et al.  Preemptive Scheduling Under Time and Resource Constraints , 1987, IEEE Transactions on Computers.

[22]  Luca Cardelli,et al.  Real Time Agents , 1982, International Colloquium on Automata, Languages and Programming.

[23]  A. W. Roscoe,et al.  An Improved Failures Model for Communicating Processes , 1984, Seminar on Concurrency.

[24]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[25]  Abha Moitra,et al.  Scheduling of Hard Real-Time Systems , 1986, FSTTCS.

[26]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[27]  Willem P. de Roever,et al.  Real-time programming and asynchronous message passing , 1983, PODC '83.

[28]  Arthur J. Bernstein,et al.  Proving real-time properties of programs with temporal logic , 1981, SOSP.

[29]  Willem P. de Roever,et al.  A Proof Rule for Fair Termination of Guarded Commands , 1985, Inf. Control..

[30]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[31]  Amir Pnueli,et al.  A Linear-History Semantics for Languages for Distributed Programming , 1984, Theor. Comput. Sci..

[32]  Michael L. Dertouzos,et al.  Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.

[33]  Juris Hartmanis,et al.  The Programming Language Ada Reference Manual American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983 , 1983, Lecture Notes in Computer Science.