On fairness notions in distributed systems. I: A characterization of implementability

DOI10.1006/inco.2000.3014zbMath1003.68010OpenAlexW2787839710MaRDI QIDQ1854419

Yuh-Jzer Joung

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.3014

zbMATH Keywords

fairnessdistributed systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Generating non-conspiratorial executions ⋮ Action systems in incremental and aspect-oriented modeling

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The existence of refinement mappings
• A distributed synchronization scheme for fair multi-process handshakes
• Calculi for synchrony and asynchrony
• Script: A communication abstraction mechanism and its verification
• Appraising fairness in languages for distributed programming
• A calculus of mobile processes. I
• Some impossibility results in interprocess synchronization
• Fairness and hyperfairness in multi-party interactions
• On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies
• The laws of Occam programming
• Real-Time Synchronization of Interprocess Communications
• An Effective Implementation for the Generalized Input-Output Construct of CSP
• CIRCAL and the representation of communication, concurrency, and time
• The multiway rendezvous
• Distributed cooperation with action systems
• Proving Liveness Properties of Concurrent Programs
• Time, clocks, and the ordering of events in a distributed system
• Communicating sequential processes
• A comprehensive study of the complexity of multiparty interaction

This page was built for publication: On fairness notions in distributed systems. I: A characterization of implementability