Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!uunet!aplcen!uakari.primate.wisc.edu!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!sdsu!ucsd!telesoft!rlk
From: rlk@telesoft.com (Bob Kitzberger @sation)
Newsgroups: comp.lang.misc
Subject: Re: CSP
Summary: Ada's tasking is based on CSP
Message-ID: <623@telesoft.com>
Date: 15 Dec 89 07:52:41 GMT
References: <74850@tut.cis.ohio-state.edu> <1989Dec11.140635.8461@cs.eur.nl>
Organization: TeleSoft, San Diego, CA.
Lines: 19

grichard@hockey.cis.ohio-state.edu (Golden Richard) writes:

>I'm looking for an implementation of a (super?)set of Hoare's
>CSP notation.  It need be neither distributed nor very robust.

Ada's tasking model is largely based on Communicating Sequential Processes.
Most of the current tasking implementations are robust; some even support 
distribution of Ada tasks over multiple CPU's.

	.Bob.

-- 
Bob Kitzberger                  Internet : rlk@telesoft.com
TeleSoft AB                     uucp :     ...!ucsd.ucsd.edu!telesoft!rlk
5959 Cornerstone Ct. West       at&t :     (619) 457-2700 x163
San Diego, CA 92121-9891        

"Now with improved warhead!"   -- Bofors Industries ad, Oct 23 _Defense News_
------------------------------------------------------------------------------