Published April 25, 2001
| Submitted
Report
Open
Refinement of Parallel and Reactive Programs
- Creators
- Back, R. J. R.
Abstract
We show how to apply the refinement calculus to stepwise refinement of parallel and reactive programs. We use action systems as our basic program model. Action systems are sequential programs which can be implemented in a parallel fashion. Hence refinement calculus methods, originally developed for sequential programs, carry over to the derivation of parallel programs. Refinement of reactive programs is handled by data refinement techniques originally developed for the sequential refinement calculus. We exemplify the approach by a derivation of a mutual exclusion algorithm.
Additional Information
© 1992 California Institute of Technology. The work reported here was supported by FINSOFT III program sponsored by the Technology Development Centre of Finland. I would like to thank Robert Barta, Ulla Binau, Bengt Jonsson, Marcel van de Groot, Peter Hofstee, Reino Kurki-Suonio, Rustan Leino, Leslie Lamport, Alan Martin, Carroll Morgan, Amir Pnueli, Kaisa Sere, Jan van de Snepscheut and Joakim von Wrigth for very helpful discussions on the topics treated here. Frank Stomp deserves a special thank, for his insistence on including environment variants in the model.Attached Files
Submitted - 92-23.pdf
Submitted - 92-23.ps
Files
92-23.pdf
Additional details
- Eprint ID
- 26764
- Resolver ID
- CaltechCSTR:1992.cs-tr-92-23
- Technology Development Centre of Finland
- Created
-
2001-04-25Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Reports
- Other Numbering System Name
- Computer Science Technical Reports
- Other Numbering System Identifier
- 92-23