As its name suggests, CSP allows us to describe systems as a number of components (processes) which operate independently and communicate with each other solely over well-defined channels. To give the archetypal CSP example; an abstract representation of a chocolate machine might be able to carry out two different events, 'coin' and 'choc' which represent the insertion of payment and the delivery of a chocolate respectively. A machine which demanded payment before offering a chocolate could be written as:
coin -> choc -> STOP
C. A. R. Hoare, Communicating Sequential Processes , Prentice-Hall 1985, ISBN 0-13-153271-8. This book has been updated by Jim Davies at the Oxford University Computer Laboratory and the new edition is available for download as a pdf file at the Using CSP (http://www.usingcsp.com/) website.
A.W. Roscoe, The Theory and Practice of Concurrency, Prentice-Hall 1997, ISBN 0-13-674409-5. Some links relating to this book are available here (http://web.comlab.ox.ac.uk/oucl/publications/books/concurrency/).
Virtual library of Formal methods CSP archive (http://www.afm.sbu.ac.uk/csp/)
WoTUG (http://www.wotug.org/), the World Occam and Transputer User Group web site contains some information about CSP and useful links.
Formal Systems (http://www.fsel.com/) develop CSP tools, some of which are freely downloadable.
Search Encyclopedia
|
Featured Article
|