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
Parents
121
Computation in networks of passively mobile finite-state sensors
Dana Angluin, James Aspnes, Zoë Diamadi et al. · Distributed Computing · 2005 · 542 citations
Razieh Nabi, Ilya Shpitser · PubMed · 2018 · 231 citations · Full text
1–5 of 121
251
5
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 251
156

Cornell University
Ithaca, United States
7 h-index
8 publications
834 citations
The University of Texas at Austin
Austin, United States
6 h-index
10 publications
295 citations

Harvard University Press
Cambridge, United States
5 h-index
6 publications
739 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
10 publications
224 citations

National Taiwan University
Taipei, Taiwan
3 h-index
3 publications
44 citations
Yale University
New Haven, United States
3 h-index
11 publications
3.4K citations

Weizmann Institute of Science
Rehovot, Israel
3 h-index
5 publications
262 citations
Université Paris Cité
Paris, France
3 h-index
6 publications
119 citations
1–8 of 156
Repository · 7 publications · 516 citations
7
h-index
Repository · 5 publications · 99 citations
5
h-index
3 publications · 52 citations
3
h-index
2 publications · 73 citations
2
h-index
2 publications · 59 citations
2
h-index
1–5