Skip to main content
SpringerLink
Log in

A Concurrent Approach to the Towers of Hanoi

  • Conference paper
Specification and Verification of Concurrent Systems

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 56 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. D. Brookes; C. A. R. Hoare and A. W. Roscoe, A Theory of Communicating Processes, Journal ACM 31 (7), 560–599 (1984).

    Article  MathSciNet  MATH  Google Scholar 

  2. W.D. Crowe and P.E.D. Strain-Clark, ODM Technical Note 3, Open University pre-print, (in preparation).

    Google Scholar 

  3. M. Gardiner, Mathematical Puzzles and Diversions. Simon and Schuster, New York (1959).

    Google Scholar 

  4. C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall International Series in Computer Science (1985).

    MATH  Google Scholar 

  5. INMOS Ltd, OCCAM Programming Manual, Prentice-Hall International Series in Computer Science (1985).

    Google Scholar 

  6. J. S. Rohl, Towers of Hanoi, The Derivation of Some Iterative Versions, The Computer Journal (20) (3), 282–285 (1977).

    Google Scholar 

  7. A. W. Roscoe and C.A.R. Hoare, The Laws of OCCAM Programming, Oxford University Computing Laboratory, Programming Research Group.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Faculty, The Open University, Milton Keynes, UK

    W. D. Crowe & P. E. D. Strain-Clark

Authors
  1. W. D. Crowe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. E. D. Strain-Clark
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, University of Stirling, Stirling, FK9 4LA, UK

    C. Rattray MSc

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag London

About this paper

Cite this paper

Crowe, W.D., Strain-Clark, P.E.D. (1990). A Concurrent Approach to the Towers of Hanoi. In: Rattray, C. (eds) Specification and Verification of Concurrent Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3534-0_30

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3534-0_30

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19581-8

  • Online ISBN: 978-1-4471-3534-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation