Appraising fairness in languages for distributed programming
The relations among various languages and models for distributed computation and various possible definitions of fairness are considered. Natural semantic criteria are presented which an acceptable notion of fairness should satisfy. These are then used to demonstrate differences among the basic models, the added power of the fairness notion, and the sensitivity of the fairness notion to irrelevant semantic interleavings of independent operations. These results are used to show that from the considerable variety of commonly used possibilities, only strong process fairness is appropriate for CSP if these criteria are adopted. We also show that under these criteria, none of the commonly used notions of fairness are fully acceptable for a model with an n-way synchronization mechanism. These notion of fairness most often mentioned for Ada is shown to be fully acceptable. For a model with nonblocking `send' operations, some variants of common fairness definitions are appraised, and two are shown to satisfy the suggested criteria.
- scientific article; zbMATH DE number 3846854
- scientific article; zbMATH DE number 512823
- Fair synthesis for asynchronous distributed systems
- scientific article; zbMATH DE number 3921985
- Fairness and communication-based semantics for session-typed languages
- scientific article; zbMATH DE number 3890707
- Localized fairness: A rewriting semantics
- A complete rule for equifair termination
- A proof rule for fair termination of guarded commands
- A proof system for concurrent ADA programs
- Appraising fairness in languages for distributed programming
- Communicating sequential processes
- Concurrent histories: a basis for observing distributed systems
- Fairness and hyperfairness in multi-party interactions
- Guarded commands, nondeterminacy and formal derivation of programs
- scientific article; zbMATH DE number 3808928 (Why is no real title available?)
- scientific article; zbMATH DE number 3808938 (Why is no real title available?)
- scientific article; zbMATH DE number 3928336 (Why is no real title available?)
- scientific article; zbMATH DE number 3963175 (Why is no real title available?)
- scientific article; zbMATH DE number 3735115 (Why is no real title available?)
- Interleaving set temporal logic
- Proof rules and transformations dealing with fairness
- Proving Liveness Properties of Concurrent Programs
- Time, clocks, and the ordering of events in a distributed system
- Two normal form theorems for CSP programs
- About fair asynchrony
- Transformations for communication fairness in CSP
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
- Fairness and the axioms of control predicates
- Appraising fairness in languages for distributed programming
- Defining conditional independence using collapses
- Sooner is safer than later
- Verification of distributed programs using representative interleaving sequences
- On equivalence-completions of fairness assumptions
- Some impossibility results in interprocess synchronization
- Fairness and hyperfairness in multi-party interactions
- A self-stabilizing algorithm for strong fairness
- On projective and separable properties
- Fairness in shared invocation servicing
- Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
- Timed runtime monitoring for multiparty conversations
- Strong fairness and full abstraction for communicating processes
- On fairness notions in distributed systems. I: A characterization of implementability
- On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies
- On the limits of refinement-testing for model-checking CSP
- Ensuring liveness properties of distributed systems: open problems
- Population protocols with unreliable communication
- Fifty years of Hoare's logic
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- Model checking with fairness assumptions using PAT
- Keep it fair: equivalence and composition
- Positive Dedalus programs tolerate non-causality
- An optimal self-stabilizing strarvation-free alternator
- Interleaving set temporal logic
- Protocols with constant local storage and unreliable communication
- Mutex needs fairness
- On deadlock and fairness decision problems for computations on client-server systems
- scientific article; zbMATH DE number 3846854 (Why is no real title available?)
- Foundations for using linear temporal logic in Event-B refinement
- Symmetric intertask communication
- scientific article; zbMATH DE number 3926216 (Why is no real title available?)
- Fairness and regularity for SCCS processes
- scientific article; zbMATH DE number 140260 (Why is no real title available?)
- scientific article; zbMATH DE number 741350 (Why is no real title available?)
- Putting logic-based distributed systems on stable grounds
- Abstraction and composition: a verification method for co-operating systems
- scientific article; zbMATH DE number 7440211 (Why is no real title available?)
- Fairness and hyperfairness
- Action systems in incremental and aspect-oriented modeling
- Keep it fair: equivalences
- Modularity for timed and hybrid systems
- Modelling mutual exclusion in a process algebra with time-outs
- Just testing
- Progress, justness and fairness in modal -calculus formulae
- On fairness and randomness
- Event fairness and non-interleaving concurrency
- Combining partial-order reductions with on-the-fly model-checking.
This page was built for publication: Appraising fairness in languages for distributed programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112589)