🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: comp.specification
Article #186

Re: parallel specification

#186
From: Ed Brinksma
Date: Thu, 13 Sep 1990 08:11
35 lines
1596 bytes
In article <4372@tuminfo1.lan.informatik.tu-muenchen.dbp.de>,
grosse@lan.informatik.tu-muenchen.dbp.de (Malte Grosse) writes:
|> 
|> Hi!
|> 
|> I am looking for parallel specification languages or sequential
|> ones which support parallel constructs. Is there any work
|> going on?
|> 
|> Malte
|> 
|> 
|> please answer to :
|> grosse@lan.informatik.tu-muenchen.dbp.de

Among the many formalisms that exist, the following represent the
so-called
'process algebraic' approach:

CCS, CSP, ACP, LOTOS, SCCS, MEIJE, CIRCAL

They all include one or more operators that explicitly model (various
forms of)
parallelism. You should be able to find references to them in any 
reasonably equipped library. The following books have appeared

	CCS	R.Milner LNCS 92
		R.Milner Communication & Concurrency, Prentice Hall
	CSP	C.A.R.Hoare Communicating Sequential Processes, Prentice Hall
	LOTOS   P.H.J. vam Eijk, C.A.Vissers, M.Diaz (eds)
			The Formal Description Technique LOTOS, North-Holand
		E. Brinksma (ed), ISO IS8807 (=International Standard) 


Ed Brinksma
Technical Details
Message-ID: <1990Sep13.101159@cs.utwente.nl>
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!mcsun!hp4nl!utrcu1!infnews!infnews!brinksma
References: <4372@tuminfo1.lan.informatik.tu-muenchen.dbp.de>

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!mcsun!hp4nl!utrcu1!infnews!infnews!brinksma
From: brinksma@cs.utwente.nl (Ed Brinksma)
Newsgroups: comp.specification
Subject: Re: parallel specification
Message-ID: <1990Sep13.101159@cs.utwente.nl>
Date: 13 Sep 90 08:11:59 GMT
References: <4372@tuminfo1.lan.informatik.tu-muenchen.dbp.de>
Sender: usenet@cs.utwente.nl
Reply-To: brinksma@cs.utwente.nl (Ed Brinksma)
Distribution: comp.specification
Organization: Twente University, Dept. of Computer Science
Lines: 35