Superposition refinement of reactive systems
- 1 May 1996
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 8 (3) , 324-346
- https://doi.org/10.1007/bf01214918
Abstract
Superposition refinement enhances an algorithm by superposing one computation mechanism onto another mechanism, in a way that preserves the behavior of the original mechanism. Superposition seems to be particularly well suited to the development of parallel and distributed programs: an originally simple sequential algorithm can be extended with mechanisms that distribute control and state information to many processes, thus permitting efficient parallel execution of the algorithm. We will show in this paper how superposition of reactive systems is expressed in the refinement calculus. We illustrate the power of this method by a case study, showing how a distributed broadcasting system is derived through a sequence of superposition refinements.Keywords
This publication has 15 references indexed in Scilit:
- A superimposition control construct for distributed systemsACM Transactions on Programming Languages and Systems, 1993
- Superposition Refinement of Parallel AlgorithmsPublished by Elsevier ,1992
- Stepwise refinement of parallel algorithmsScience of Computer Programming, 1990
- Refinement calculus, part I: Sequential nondeterministic programsPublished by Springer Nature ,1990
- Refinement calculus, part II: Parallel and reactive programsPublished by Springer Nature ,1990
- Action system approach to the specification and design of distributed systemsACM SIGSOFT Software Engineering Notes, 1989
- A calculus of refinements for program derivationsActa Informatica, 1988
- The specification statementACM Transactions on Programming Languages and Systems, 1988
- A theoretical basis for stepwise refinement and the programming calculusScience of Computer Programming, 1987
- On-the-fly garbage collectionCommunications of the ACM, 1978