About fair asynchrony
type: Item
instance of: scholarly article
title: About fair asynchrony
zbMATH Open document ID: 0607.68016
DOI: 10.1016/0304-3975(85)90095-7
author: Philippe Darondeau
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
review text: This paper examines the joint influence of fairness and asynchrony on the semantic modelling of a CCS-like language. Fairness is the guarantee for every agent engaged in a computation to communicate with the other asynchronous agents if such communications are infinitely often possible. Programs are compared according to an implementation preorder which reflects the inclusion of observable properties: whenever, for every context \({\mathcal C}\) and for every program r, no computation of r experimenting upon \({\mathcal C}(p)\) allows to recognize p versus q, p is considered less than q. A fully abstract model of the preorder is constructed in a domain of infinitary languages, preferred here to classical algebraic domains. The restriction to bounded parallelism is analysed. In that simplified framework, the model turns effective and, moreover, decidable.
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68Q65
zbMATH DE Number: 3982500
zbMATH Keywords: fairness
zbMATH Keywords: asynchrony
zbMATH Keywords: semantic modelling of a CCS-like language
zbMATH Keywords: asynchronous agents
zbMATH Keywords: communications
zbMATH Keywords: infinitary languages
zbMATH Keywords: classical algebraic domains
zbMATH Keywords: parallelism
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90095-7
OpenAlex ID: W2149314970
cites work: A Theory of Communicating Sequential Processes
cites work: A fair calculus of communicating systems
cites work: Q3940827
cites work: Q3667927
cites work: Q3694724
cites work: Towards a formal proof system for \(\omega\)-rational expressions
cites work: Q4079524
cites work: Q3738547
cites work: Q3883467
cites work: Synchronous and asynchronous experiments on processes
cites work: The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
cites work: Q3940829
cites work: Fully abstract models of typed \(\lambda\)-calculi
cites work: Flowgraphs and Flow Algebras
cites work: A calculus of communicating systems
cites work: Calculi for synchrony and asynchrony
cites work: Q3906397
cites work: A structural approach to operational semantics
cites work: Q3922134
description: scientific article; zbMATH DE number 3982500