An algebraic theory of fair asynchronous communicating processes
type: Item
instance of: scholarly article
title: An algebraic theory of fair asynchronous communicating processes
zbMATH Open document ID: 0612.68026
DOI: 10.1016/0304-3975(87)90004-1
published in: Theoretical Computer Science
publication date: 1987-01-01T00:00:00Z
review text: Cf. the review of the preliminary version [Lect. Notes Comput. Sci. 194, 260-269 (1985)] in Zbl 0566.68022.
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3990853
zbMATH Keywords: fair asynchronous communicating processes
zbMATH Keywords: denotational semantics
author: Matthew Hennessy
MaRDI profile type: Publication
full work available at URL: 0304-3975(87)90004-1
OpenAlex ID: W2048399275
cites work: Proof rules and transformations dealing with fairness
cites work: Q3667927
cites work: Q3678656
cites work: Testing equivalences for processes
cites work: Synchronous and asynchronous experiments on processes
cites work: Acceptance trees
cites work: A calculus of communicating systems
cites work: Q3906397
description: scientific article; zbMATH DE number 3990853