A Caltech Library Service

Refinement of Parallel and Reactive Programs

Back, R.J.R. (1992) Refinement of Parallel and Reactive Programs. California Institute of Technology . (Unpublished)

See Usage Policy.

Other (Adobe PDF (926KB))
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Report or Paper (Technical Report)
Group:Computer Science Technical Reports
Record Number:CaltechCSTR:1992.cs-tr-92-23
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26764
Deposited By: Imported from CaltechCSTR
Deposited On:25 Apr 2001
Last Modified:26 Dec 2012 14:04

Repository Staff Only: item control page