Abstract
It is shown how to apply the refinement calculus to stepwise refinement of both parallel programs and reactive programs. The approach is based on using the action systems model to describe parallel and reactive systems. Action systems are sequential programs which can be implemented in a parallel fashion. Hence the refinement calculus for sequential programs carries over to the parallel programs expressed in this framework. Refinement of reactive programs can be expressed and proved in the refinement calculus by using the methods of data refinement from the sequential refinement calculus.
Author supplied keywords
Cite
CITATION STYLE
Back, R. J. R. (1990). Refinement calculus, part II: Parallel and reactive programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 430 LNCS, pp. 67–93). Springer Verlag. https://doi.org/10.1007/3-540-52559-9_61
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
