A Concurrent Approach to the Towers of Hanoi

  • W. D. Crowe
  • P. E. D. Strain-Clark
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


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.


Small Disc Communicate Sequential Process Reusable Component Asynchronous Process Tower Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. D. Brookes; C. A. R. Hoare and A. W. Roscoe, A Theory of Communicating Processes, Journal ACM 31 (7), 560–599 (1984).MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    W.D. Crowe and P.E.D. Strain-Clark, ODM Technical Note 3, Open University pre-print, (in preparation).Google Scholar
  3. [3]
    M. Gardiner, Mathematical Puzzles and Diversions. Simon and Schuster, New York (1959).Google Scholar
  4. [4]
    C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall International Series in Computer Science (1985).MATHGoogle Scholar
  5. [5]
    INMOS Ltd, OCCAM Programming Manual, Prentice-Hall International Series in Computer Science (1985).Google Scholar
  6. [6]
    J. S. Rohl, Towers of Hanoi, The Derivation of Some Iterative Versions, The Computer Journal (20) (3), 282–285 (1977).Google Scholar
  7. [7]
    A. W. Roscoe and C.A.R. Hoare, The Laws of OCCAM Programming, Oxford University Computing Laboratory, Programming Research Group.Google Scholar

Copyright information

© Springer-Verlag London 1990

Authors and Affiliations

  • W. D. Crowe
    • 1
  • P. E. D. Strain-Clark
    • 1
  1. 1.Mathematics FacultyThe Open UniversityMilton KeynesUK

Personalised recommendations