{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T01:19:09Z","timestamp":1790817549282,"version":"4.1.0"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T00:00:00Z","timestamp":1567123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2020,7,31]]},"abstract":"<jats:p>Fairness assumptions are a valuable tool when reasoning about systems. In this article, we classify several fairness properties found in the literature and argue that most of them are too restrictive for many applications. As an alternative, we introduce the concept of justness.<\/jats:p>","DOI":"10.1145\/3329125","type":"journal-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T12:47:00Z","timestamp":1567514820000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Progress, Justness, and Fairness"],"prefix":"10.1145","volume":"52","author":[{"given":"Rob Van","family":"Glabbeek","sequence":"first","affiliation":[{"name":"Data61, CSIRO and UNSW, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2141-5868","authenticated-orcid":false,"given":"Peter","family":"H\u00f6fner","sequence":"additional","affiliation":[{"name":"Data61, CSIRO and UNSW, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01872848"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(83)90004-7"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90052-1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/103272"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1373322"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/362946.362970"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647704.734495"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/16663.16664"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90114-5"},{"key":"e_1_2_1_10_1","volume-title":"Explicit fairness in testing semantics. Logic. Methods Comput. Sci. 5, 2","author":"Cacciagrano Diletta","year":"2009","unstructured":"Diletta Cacciagrano, Flavio Corradini, and Catuscia Palamidessi. 2009. Explicit fairness in testing semantics. Logic. Methods Comput. Sci. 5, 2 (2009)."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38493-6_4"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-006-0011-2"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.02.011"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00271640"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90013-7"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/201019.201032"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/762971.762974"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.255.2"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(83)90017-5"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/4904.4999"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28869-2_15"},{"key":"e_1_2_1_22_1","unstructured":"Ansgar Fehnker Robert J. van Glabbeek Peter H\u00f6fner Annabelle K. McIver Marius Portmann and Wee Lum Tan. 2013. A Process Algebra for Wireless Mesh Networks Used for Modelling Verifying and Analysing AODV. Technical Report 5513. NICTA. http:\/\/arxiv.org\/abs\/1312.7645."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90107-2"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","unstructured":"Nissim Francez. 1986. Fairness. Springer.","DOI":"10.5555\/19247"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/567446.567462"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360000041"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-015-0221-6"},{"key":"e_1_2_1_28_1","unstructured":"Robert J. van Glabbeek and Peter H\u00f6fner. 2015. Progress Fairness and Justness in Process Algebra. Technical Report 8501. NICTA. Retrieved from http:\/\/arxiv.org\/abs\/1501.03268."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817949_9"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80014-5"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80014-0"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359585"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.3015"},{"key":"e_1_2_1_34_1","unstructured":"Ruurd Kuiper and Willem-Paul de Roever. 1983. Fairness assumptions for CSP in a temporal logic framework. In Formal Description of Programming Concepts II Dines Bj\u00f8rner (Ed.). North-Holland 159--170."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0950-5849(89)90159-6"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/361082.361093"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.229904"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008921"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/579617"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/646235.682695"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363366"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/646243.681453"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/211468"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/539036"},{"key":"e_1_2_1_45_1","unstructured":"Jayadev Misra. 1988. A Rebuttal of Dijkstra\u2019s Position on Fairness. Retrieved from http:\/\/www.cs.utexas.edu\/users\/misra\/Notes.dir\/fairness.pdf."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/381192"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357178"},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the 6th IBM Symposium on Mathematical Foundations of Computer Science","author":"Park David M. R.","year":"1981","unstructured":"David M. R. Park. 1981. A predicate transformer for weak fair iteration. In Proceedings of the 6th IBM Symposium on Mathematical Foundations of Computer Science, Hakone, Japan. 211--228. http:\/\/hdl.handle.net\/2433\/103001."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC3561"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90106-X"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808757"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01379149"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00265555"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/2535024"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00300-0"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220360"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.5555\/111713.111729"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3329125","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3329125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T13:26:10Z","timestamp":1750857970000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3329125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,30]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7,31]]}},"alternative-id":["10.1145\/3329125"],"URL":"https:\/\/doi.org\/10.1145\/3329125","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,30]]},"assertion":[{"value":"2018-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-04-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}