Cover Image
Read Now

Fairness

The main purpose of this book is to bring together much of the research conducted in recent years in a subject I find both fascinating and impor­ tant, namely fairness. Much of the reported research is still in the form of technical reports, theses and conference papers, and only a small part has al...

Full description

Bibliographic Details
Main Author: Francez, Nissim
Format: eBook
Language:English
Published: New York, NY Springer New York 1986, 1986
Edition:1st ed. 1986
Series:Monographs in Computer Science
Subjects:
Computer Science Logic And Foundations Of Programming
Software Engineering
Computer Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • 0 Introduction
  • 0.1 Motivation and Background
  • 0.2 A Taxonomy of Fairness Concepts
  • 0.3 The Language of Guarded Commands (GC)
  • 1 Termination and Well-Foundedness
  • 1.0 Overview
  • 1.1 Termination Proofs for Deterministic Programs
  • 1.2 Termination Proofs for Nondeterministic Programs
  • 2 The Method of Helpful Directions
  • 2.0 Introduction to Fair Termination
  • 2.1 Ordinal Directed Choice of Helpful Directions
  • 2.2 State Directed Choice of Helpful Directions
  • 2.3 Inter-reducibility of the Two Methods
  • 2.4 Relativized Fair Termination
  • 3 The Method of Explicit Scheduler
  • 3.0 Overview
  • 3.1 Unconditionally-Fair Termination
  • 3.2 Weak and Strong Fairness: n Guards
  • 3.3 All-Levels Fairness
  • 3.4 Comparing Explicit Scheduler with Helpful Directions
  • 3.5 More on Fairness and Random Assignments
  • 4 Extension and Generalizations of Fairness
  • 4.0 Overview
  • 4.1 Equifairness
  • 4.2 Generalized Fairness
  • 4.3 Extreme Fairness
  • 4.4 An Analysis of Predicate-Reachability Fairness
  • 5 Fair Termination of Concurrent Processes
  • 5.1 Overview
  • 5.2 Fairness and Communicating Processes
  • 5.3 Fairness in Shared-Variables Concurrency
  • 6 Syntactic Expressibility
  • 6.0 Overview
  • 6.1 Fixedpoints of Monotone Transformations
  • 6.2 The Assertion Language L?
  • 6.3 The Weakest Precondition for Fair Termination
  • 6.4 Syntactic Completeness of the SFT Rule
  • 6.5 The Ordinal Size for Fair-Termination Proofs
  • 7 Fairness in Temporal Logic
  • 7.0 Overview
  • 7.1 Linear-Time Temporal-Logic (LTL)
  • 7.2 Branching-Time Temporal-Logics (BTL)
  • 8 The Functional Approach
  • 8.0 Overview
  • 8.1 CCS
  • 8.2 Fairness and CCS
  • 8.3 Weak and Strong Fairness in CCS
  • 8.4 A Metric Characterization of CCS Fairness
  • 8.5 Finite Delay Operators
  • References
  • List of Proof Rules
  • Author Index

Similar Items