A Concurrent Approach to the Towers of Hanoi
The tower of Hanoi problem has long been known to have a closed (ie non-recursive) solution. In this paper we analyse two approaches to this solution which involve concurrency. This is not an end in itself, but serves to introduce the main ideas and notations of CAP (Communicating Asynchronous Processes) — a revision of CSP which the authors have used successfully to develop correct Occam programs. In turn, CAP is part of a wider development method (ODM) which is being studied with the intention of prototyping software tools to assist developers of concurrent software.
KeywordsSmall Disc Communicate Sequential Process Reusable Component Asynchronous Process Tower Model
Unable to display preview. Download preview PDF.
- W.D. Crowe and P.E.D. Strain-Clark, ODM Technical Note 3, Open University pre-print, (in preparation).Google Scholar
- M. Gardiner, Mathematical Puzzles and Diversions. Simon and Schuster, New York (1959).Google Scholar
- INMOS Ltd, OCCAM Programming Manual, Prentice-Hall International Series in Computer Science (1985).Google Scholar
- J. S. Rohl, Towers of Hanoi, The Derivation of Some Iterative Versions, The Computer Journal (20) (3), 282–285 (1977).Google Scholar
- A. W. Roscoe and C.A.R. Hoare, The Laws of OCCAM Programming, Oxford University Computing Laboratory, Programming Research Group.Google Scholar