Fairness Conditions

Fairness Conditions is a formal constraint in model checking that belongs to the class of temporal logic specifications, distinguishing itself by requiring that certain desirable behaviors or transitions must occur infinitely often in infinite executions to exclude unrealistic counterexamples arising from unfair scheduling.

121

Publications

7K

Citations

251

Authors

156

Institutions

Publications per year

2017–2026

35

Variants

Fairness Assumptions

Authors

251

  1. JK
    Jon Kleinberg

    Cornell University, United States

    5 publications · 1.2K citations

    5

    h-index

  2. SS
    Sonja Smets

    University of Oxford, United Kingdom

    3 publications · 59 citations

    3

    h-index

  3. JA
    James Aspnes

    Yale University, United States

    3 publications · 697 citations

    3

    h-index

  4. AB
    Alexandru Baltag

    University of Oxford, United Kingdom

    3 publications · 59 citations

    3

    h-index

  5. YJ
    Yuh-Jzer Joung

    National Taiwan University, Taiwan

    3 publications · 44 citations

    3

    h-index

1–5 of 251

Venues

  1. arXiv (Cornell University)

    Repository · 7 publications · 516 citations

    7

    h-index

  2. SSRN Electronic Journal

    Repository · 5 publications · 99 citations

    5

    h-index

  3. Information and Computation

    3 publications · 52 citations

    3

    h-index

  4. Theoretical Computer Science

    2 publications · 73 citations

    2

    h-index

  5. Information Processing Letters

    2 publications · 59 citations

    2

    h-index

1–5