Weak and strong fairness in CCS
type: Item
instance of: scholarly article
title: Weak and strong fairness in CCS
zbMATH Open document ID: 0618.68026
DOI: 10.1016/0890-5401(87)90013-7
author: Gerardo Costa
author: Colin Stirling
published in: Information and Computation
publication date: 1987-01-01T00:00:00Z
review text: We examine the issue of weak and strong fairness in the framework of Milner's CCS. Our approach is operational. We address the problem of giving sets of finite rules for generating all and only the admissible execution sequences when fairness is assumed. We achieve our aims by defining two calculi, one for weak and the other for strong fairness. Both calculi are extensions of standard CCS. In neither case do we appeal to random assignment or to transformations. A distinguishing feature of the weak fair calculus, unlike standard approaches which appeal to random assignment, is that it does not involve predictive choice.
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 4003511
zbMATH Keywords: communicating systems
zbMATH Keywords: parallel systems
zbMATH Keywords: Milner's CCS
zbMATH Keywords: admissible execution sequences
zbMATH Keywords: calculi
MaRDI profile type: Publication
full work available at URL: 0890-5401(87)90013-7
OpenAlex ID: W2079457432
cites work: Proof rules and transformations dealing with fairness
cites work: Q3677159
cites work: Q3666267
cites work: Q3667927
cites work: Axiomatising finite delay operators
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Q3221398
cites work: Q3922147
cites work: A calculus of communicating systems
cites work: Proving Liveness Properties of Concurrent Programs
cites work: Q3906397
cites work: Q4749207
cites work: Fairness and related properties in transition systems - a temporal logic to deal with fairness
description: scientific article; zbMATH DE number 4003511