Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
type: Item
instance of: scholarly article
title: Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
zbMATH Open document ID: 0944.68195
DOI: 10.1016/S0304-3975(98)00224-2
author: N. Delaunay
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 1493441
zbMATH Keywords: randomized algorithm
zbMATH Keywords: strong interaction fairness
zbMATH Keywords: weak interaction fairness
zbMATH Keywords: multiparty interaction
describes a project that uses: LOTOS
describes a project that uses: Ada95
MaRDI profile type: Publication
cites work: Appraising fairness in languages for distributed programming
cites work: Distributed cooperation with action systems
cites work: Q4836494
cites work: An Effective Implementation for the Generalized Input-Output Construct of CSP
cites work: Q4114551
cites work: Q4864236
cites work: Script: A communication abstraction mechanism and its verification
cites work: Communicating sequential processes
cites work: Q4818828
cites work: A comprehensive study of the complexity of multiparty interaction
cites work: Q3126969
cites work: Calculi for synchrony and asynchrony
cites work: Q3992568
cites work: A calculus of mobile processes. I
cites work: A calculus of mobile processes. II
cites work: A distributed synchronization scheme for fair multi-process handshakes
cites work: Q4723292
cites work: Real-Time Synchronization of Interprocess Communications
cites work: Some impossibility results in interprocess synchronization
full work available at URL: s0304-3975(98)00224-2
OpenAlex ID: W2164096633
Wikidata QID: Q127942801
description: scientific article; zbMATH DE number 1493441