On fairness notions in distributed systems. I: A characterization of implementability
From MaRDI portal
Recommendations
- On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies
- scientific article; zbMATH DE number 3846854
- scientific article; zbMATH DE number 2102741
- Fair synthesis for asynchronous distributed systems
- Defining fairness in reactive and concurrent systems
- On fairness of D0L systems
- Stepwise development of fair distributed systems
- Fairness of actions in system computations
- Tools and Algorithms for the Construction and Analysis of Systems
- scientific article; zbMATH DE number 512823
Cites work
- A calculus of mobile processes. I
- A comprehensive study of the complexity of multiparty interaction
- A distributed synchronization scheme for fair multi-process handshakes
- An Effective Implementation for the Generalized Input-Output Construct of CSP
- Appraising fairness in languages for distributed programming
- Calculi for synchrony and asynchrony
- CIRCAL and the representation of communication, concurrency, and time
- Communicating sequential processes
- Distributed cooperation with action systems
- Fairness and hyperfairness in multi-party interactions
- scientific article; zbMATH DE number 4060693 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3997156 (Why is no real title available?)
- scientific article; zbMATH DE number 2102741 (Why is no real title available?)
- scientific article; zbMATH DE number 839543 (Why is no real title available?)
- On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies
- Proving Liveness Properties of Concurrent Programs
- Real-Time Synchronization of Interprocess Communications
- Script: A communication abstraction mechanism and its verification
- Some impossibility results in interprocess synchronization
- The existence of refinement mappings
- The laws of Occam programming
- The multiway rendezvous
- Time, clocks, and the ordering of events in a distributed system
Cited in
(13)- Some impossibility results in interprocess synchronization
- Fairness and hyperfairness in multi-party interactions
- Stepwise development of fair distributed systems
- Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
- On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies
- Generating non-conspiratorial executions
- On deadlock and fairness decision problems for computations on client-server systems
- A Distributed Maximal Scheduler for Strong Fairness
- scientific article; zbMATH DE number 2090635 (Why is no real title available?)
- scientific article; zbMATH DE number 2102741 (Why is no real title available?)
- Action systems in incremental and aspect-oriented modeling
- Tools and Algorithms for the Construction and Analysis of Systems
- Rappel: exploiting interest and network locality to improve fairness in publish-subscribe systems
This page was built for publication: On fairness notions in distributed systems. I: A characterization of implementability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854419)
