{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T19:51:35Z","timestamp":1789847495406,"version":"4.0.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1007\/bf01872848","type":"journal-article","created":{"date-parts":[[2005,7,2]],"date-time":"2005-07-02T11:26:11Z","timestamp":1120303571000},"page":"226-241","source":"Crossref","is-referenced-by-count":110,"title":["Appraising fairness in languages for distributed programming"],"prefix":"10.1007","volume":"2","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nissim","family":"Francez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shmuel","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF01872848_CR1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0020-0190(87)90001-9","volume":"26","author":"KR Apt","year":"1987\/88","unstructured":"[ABC] Apt KR, Boug\u00e9 L, Clermont P (1987\/88) Two normal form theorems for CSP programs. Inf Proc Lett 26: 165\u2013171","journal-title":"Inf Proc Lett"},{"key":"BF01872848_CR2","doi-asserted-by":"crossref","unstructured":"[AFK] Apt KR, Francez N, Katz S (1987) Appraising fairness in languages for distributed programming. Proc of 14th ACM-POPL Symp, Munich, West Germany (January 1987)","DOI":"10.1145\/41625.41642"},{"key":"BF01872848_CR3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6423(83)90004-7","volume":"3","author":"KR Apt","year":"1983","unstructured":"[AO] Apt KR, Olderog ER (1983) Proof rules and transformations dealing with fairness. Sci Comp Prog 3:65\u2013100","journal-title":"Sci Comp Prog"},{"key":"BF01872848_CR4","unstructured":"[AF] Attie P, Francez N (1988) Fairness and hyperfairness in multiparty interactions. MCC-STP Tech Rep (July 1987)"},{"key":"BF01872848_CR5","doi-asserted-by":"crossref","unstructured":"[BK-S 1] Back RJ, Kurki-Suonio K (1983) Decentralization of process nets with centralized control. Proc of 2nd ACM-PODC Symp, Montreal (August 1983)","DOI":"10.1145\/800221.806716"},{"key":"BF01872848_CR6","unstructured":"[BK-S 2] Back RJ, Kurki-Suonio K (1985) Serializability in distributed systems with handshaking. CMU Tech Rep, pp 85\u2013109"},{"key":"BF01872848_CR7","doi-asserted-by":"crossref","unstructured":"[BF] Boug\u00e9 L, Francez N (1988) A compositional approach to superimposition. Proc of 15th ACM-POPL Symp. San Diego, California (January 1988)","DOI":"10.1145\/73560.73581"},{"key":"BF01872848_CR8","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"EW Dijkstra","year":"1975","unstructured":"[D] Dijkstra EW (1975) Guarded commands, nondeterminacy and formal derivation of programs. Commun ACM 18:453\u2013467","journal-title":"Commun ACM"},{"key":"BF01872848_CR9","unstructured":"[DM] Degano P, Montanari U (1988) Concurrent histories, a basis for observing distributed systems (to appear in J Comp Syst Sci)"},{"key":"BF01872848_CR10","unstructured":"[Fo] Forman I (1986) On the design of large distributed systems. Proc of Int Conf on Comp Lang, Miami Beach, Florida (October 1986)"},{"key":"BF01872848_CR11","volume-title":"Texts and monographs in computer science series","author":"N Francez","year":"1986","unstructured":"[Fr] Francez N (1986) Fairness. In: Gries D (ed) Texts and monographs in computer science series. Springer, New York"},{"key":"BF01872848_CR12","unstructured":"[FdR] Francez N, de Roever WP (1980) Fairness in communicating processes (unpublished memo) Computer Science Department, Utrecht University (July 1980)"},{"key":"BF01872848_CR13","doi-asserted-by":"crossref","unstructured":"[FK] Francez N, Katz S (1988) Fairness and the axioms of control predicates. To appear in Int J Parallel Programming","DOI":"10.1007\/BF01407937"},{"issue":"no 2","key":"BF01872848_CR14","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6423(84)90018-2","volume":"4","author":"RT Gerth","year":"1984","unstructured":"[GdR] Gerth RT, de Roever WP (1984) A proof system for concurrent Ada programs. Science of Computer Programming, vol 4, no 2, pp 159\u2013204","journal-title":"Science of Computer Programming"},{"key":"BF01872848_CR15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0022-0000(86)90056-5","volume":"33","author":"O Grumberg","year":"1986","unstructured":"[GFK 1] Grumberg O, Francez N, Katz S (1986) A complete rule for equifair termination. J Comp Syst Sci 33:313\u2013332","journal-title":"J Comp Syst Sci"},{"key":"BF01872848_CR16","doi-asserted-by":"crossref","unstructured":"[GFK 2] Grumberg O, Francez N, Katz S (1984) Fair termination of communicating processes. Proc of 3rd ACM-PODC Symp, Vancouver (August 1984)","DOI":"10.1145\/800222.806752"},{"key":"BF01872848_CR17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0019-9958(85)80014-0","volume":"66","author":"O Grumberg","year":"1985","unstructured":"[GFMdR] Grumberg O, Francez N, Makowsky J, de Roever WP (1985) A proof rule for fair termination of guarded commands. Inf Control 66:83\u2013102","journal-title":"Inf Control"},{"key":"BF01872848_CR18","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"CAR Hoare","year":"1978","unstructured":"[H] Hoare CAR (1978) Communicating sequential processes Commun ACM 21:666\u2013677","journal-title":"Commun ACM"},{"key":"BF01872848_CR19","unstructured":"[HLP] Hennessey W, Wei-Li, Plotkin GD (1983) Semantics for Ada tasks. In: Bj\u00f6rner D (ed) Proceedings of TC.2 Working Conference on the Formal Description of Programming Concepts, Garmisch Partenkirchen. North Holland"},{"key":"BF01872848_CR20","unstructured":"[K] Katz S (1987) A superimposition control construct for distributed systems. MCC-STP Tech Rep STP-268-87"},{"key":"BF01872848_CR21","doi-asserted-by":"crossref","unstructured":"[KP] Katz S, Peled D (1987) Interleaving set temporal logic. Proc of 6th ACM-PODC Symp, Vancouver, Canada (August 1987)","DOI":"10.1145\/41840.41855"},{"key":"BF01872848_CR22","unstructured":"[KdR] Kuiper R, de Roever WP (1983) Fairness assumptions for CSP in a temporal logic framework. In: Bj\u00f6rner D (ed) Proceedings of TC.2 Working Conference on the Formal Description of Programming Concepts, Garmisch Partenkirchen, North Holland"},{"key":"BF01872848_CR23","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"[L 1] Lamport L (1978) Time, clocks, and the ordering of events. Commun ACM 21: 558\u2013566","journal-title":"Commun ACM"},{"key":"BF01872848_CR24","unstructured":"[L 2] Lamport L (1983) What good is temporal logic? Proc of 9th IFIP Cong, Paris, France (September 1983)"},{"key":"BF01872848_CR25","first-page":"264","volume-title":"Proc of 8th ICALP, Acco, Israel (July 1981)","author":"D Lehmann","year":"1981","unstructured":"[LPS] Lehmann D, Pnueli A, Stavi J (1981) Impartiality, justice, and fairness: the ethics of concurrent termination. In: Kariv O, Even S (eds)] Proc of 8th ICALP, Acco, Israel (July 1981) LNCS 115. Springer Berlin Heidelberg New York, pp 264\u2013277"},{"key":"BF01872848_CR26","doi-asserted-by":"crossref","unstructured":"[OA] Olderog ER, Apt KR. (1988) Fairness in parallel programs, the transformational approach (to appear in ACM Toplas)","DOI":"10.1145\/44501.44504"},{"issue":"3","key":"BF01872848_CR27","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"SS Owicki","year":"1982","unstructured":"[OL] Owicki SS, Lamport L (1982) Proving liveness properties of concurrent programs. ACM Trans Prog Lang Syst 4(3):455\u2013495","journal-title":"ACM Trans Prog Lang Syst"},{"key":"BF01872848_CR28","doi-asserted-by":"crossref","unstructured":"[P] Plotkin GD (1983) An operational semantics for CSP. In: Bj\u00f6rner D (ed) Proceedings of TC.2 Working Conference on the Formal Description of Programming Concepts, Garmisch Partenkirchen. North Holland","DOI":"10.1007\/3-540-11981-7_17"},{"key":"BF01872848_CR29","doi-asserted-by":"crossref","unstructured":"[PdR] Pnueli A, de Roever WP (1982) Rendezvous with Ada: a proof-theoretic view. Proceedings of the AdaTec Conference, Crystal City","DOI":"10.1145\/3304133.3304152"},{"key":"BF01872848_CR30","unstructured":"[R] Reisig W (1984) Partial order semantics versus interleaving semantics and its impact on fairness. Proc 11th ICALP, Antwerp, 1984"},{"key":"BF01872848_CR31","doi-asserted-by":"crossref","unstructured":"[RS] Reif J, Spirakis P (1983) Probabilistic bidding gives optimal distributed resource allocation. Aiken Computation Lab Tech Rep, Harvard University (July 1983)","DOI":"10.1007\/3-540-13345-3_36"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01872848.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01872848\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01872848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T03:35:06Z","timestamp":1586316906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01872848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["BF01872848"],"URL":"https:\/\/doi.org\/10.1007\/bf01872848","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}