Fairness
Parallel program design: a foundation
Parallel program design: a foundation
A predicate transformer approach to semantics of parallel programs
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Refinement as a basis for concurrent program design
Refinement as a basis for concurrent program design
Distributed coordination of process interactions: fairness and fault tolerance
Distributed coordination of process interactions: fairness and fault tolerance
Fault-Tolerant Algorithms for Fair Interprocess Synchronization
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
We explore the use of UNITY logic in specifying and verifying fairness properties of UNITY and UNITY-like programs whose semantics can be modeled by weakly fair transition systems. For such programs, strong fairness properties in the form of “if p holds infinitely often then q also holds infinitely often □◊p⇒□◊q , can be expressed as conditional UNITY properties of the form of “Hypothesis: true→p Conclusion:true→q ”. We show that UNITY logic is relatively complete for proving such properties; in the process, a simple inference rule is derived. Specification and verification of weak fairness properties are also discussed.