On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies

DOI10.1006/INCO.2000.3015zbMath1003.68009OpenAlexW1531635780MaRDI QIDQ1854420

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.3015

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 (3)

Generating non-conspiratorial executions ⋮ On fairness notions in distributed systems. I: A characterization of implementability ⋮ On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies

Cites Work

• Unnamed Item
• Unnamed Item
• Appraising fairness in languages for distributed programming
• On equivalence-completions of fairness assumptions
• On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies

This page was built for publication: On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies