Path: utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!uunet!aplcen!samsung!munnari.oz.au!basser!cluster!johnz
From: johnz@cs.su.oz (John Zic)
Newsgroups: comp.lang.misc
Subject: Re: CSP
Message-ID: <669@cluster.cs.su.oz>
Date: 15 Dec 89 23:18:25 GMT
References: <74850@tut.cis.ohio-state.edu> <1989Dec11.140635.8461@cs.eur.nl> <6229@nigel.udel.EDU>
Sender: news@cluster.cs.su.oz
Reply-To: johnz@cluster.cs.su.oz (John Zic)
Organization: Basser Dept of Computer Science, University of Sydney, Australia
Lines: 30

In article <6229@nigel.udel.EDU> new@udel.edu (Darren New) writes:
>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.
>
>You may want to look into a language called LOTOS.
>Protocol people use it to specify network protocols among other
>things.  It's based on CSP and ACT-ONE.  Ask on the networks groups
			^^^
>for researchers with interpreters for it.    -- Darren

LOTOS is based on Robin Milner's CCS with the addition of
abstract data types (provided by ACT-ONE).  Here's the reference:
	@book{Miln80,
		title = "A Calculus of Communicating Systems",
		publisher = "Springer-Verlag",
		year = "1980",
		author = "Milner, R.",
		volume = "92",
		series = " Lecture Notes in Computer Science",
		address = " Berlin--Heidelberg--New York"
	}

I regard LOTOS as a specification technique, rather than an
implementation language -- although there may be some implementation
of LOTOS around. Warning -- religious belief follows -- stick to
Occam; it is a nice implementation of the CSP algebra with which one
can reason about safety etc of a specification in the CSP
traces/failures/divergences model.