Characterizing fairness implementability for multiparty interaction

DOI10.1007/3-540-61440-0_121MaRDI QIDQ4818828zbMATH OpenFDO

Authors Yuh-Jzer Joung

Publication date 24 September 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61440-0_121

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On fairness notions in distributed systems. I: A characterization of implementability
• scientific article; zbMATH DE number 39877
• Fairness and hyperfairness in multi-party interactions
• Fairness in systems based on multiparty interactions
• Fairness and hyperfairness

Cited in

(6)

• Fairness and hyperfairness in multi-party interactions
• Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
• On fairness notions in distributed systems. I: A characterization of implementability
• On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies
• Fairness in systems based on multiparty interactions
• An algorithm for ensuring fairness and liveness in non-deterministic systems based on multiparty interactions

This page was built for publication: Characterizing fairness implementability for multiparty interaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818828)