Real-time refinement in Manna and Pnueli's temporal logic

A refinement calculus for the development of real-time systems is presented. The calculus is based upon a wide-spectrum language called TAM (the Temporal Agent Model), within which both functional and timing properties can be expressed in either abstract or concrete terms. A specification oriented semantics is given for the language. Program development is considered as a refinement process i.e. thecalculation of a structured program from an unstructured specification. An example program is developed.

[1]  C. A. R. Hoare,et al.  A Calculus of Durations , 1991, Inf. Process. Lett..

[2]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[3]  Carroll Morgan,et al.  Programming from specifications , 1990, Prentice Hall International Series in computer science.

[4]  Hussein Zedan,et al.  A Specification-Oriented Semantics for the Refinement of Real-Time Systems , 1994, Theor. Comput. Sci..

[5]  Z. Manna,et al.  Verification of concurrent programs: a temporal proof system , 1983 .

[6]  Jozef Hooman,et al.  Specification and Compositional Verification of Real-Time Systems , 1991, Lecture Notes in Computer Science.

[7]  Willem P. de Roever,et al.  Examples of a Real-Time Temporal Logic Specification , 1983, The Analysis of Concurrent Systems.

[8]  Howard Barringer.  A Survey of Verification Techniques for Parallel Programs , 1985, Lecture Notes in Computer Science.

[9]  Ralph-Johan Back,et al.  A calculus of refinements for program derivations , 1988, Acta Informatica.

[10]  Ralph-Johan Back,et al.  Correctness preserving program refinements: Proof theory and applications , 1980 .

[11]  Carroll Morgan,et al.  The Refinement Calculus , 1994, NATO ASI PDC.

[12]  Ralph-Johan Back,et al.  Refinement concepts formalised in higher order logic , 2005, Formal Aspects of Computing.