Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems

@inproceedings{Pnueli2005SeparatingFA,
  title={Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems},
  author={Amir Pnueli and Andreas Podelski and Andrey Rybalchenko},
  booktitle={TACAS},
  year={2005}
}
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete systems involves a non-trivial interplay between fairness and well-foundedness (ranking functions). This interplay has been an obstacle for automation. The contribution of this paper is a new analysis of temporal properties of FDSs. The analysis uses a domain of binary relations over states labeled by sets of indices of… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…