%T A concurrent approach to the Towers of Hanoi
%A W. D. Crowe, P. E. D. Strain-Clark
%E Charlie Askew
%B OUG\-9: Occam and the Transputer \-\- Research and Applications
%X 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
If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.
Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org