Loading…

Fairness and hyperfairness

The notion of fairness in trace-based formalisms is examined. It is argued that, in general, fairness means machine closure. The notion of hyperfairness introduced by Attie, Francez, and Grumberg is generalized to arbitrary action systems. Also examined are the fairness criteria proposed by Apt, Fra...

Full description

Saved in:
Bibliographic Details
Published in:Distributed computing 2000-11, Vol.13 (4), p.239-245
Main Author: Lamport, Leslie
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c287t-8a5f0664fd834f59d9db31ac5518a776b368c4734f931cd53ba0698d6454bf453
cites
container_end_page 245
container_issue 4
container_start_page 239
container_title Distributed computing
container_volume 13
creator Lamport, Leslie
description The notion of fairness in trace-based formalisms is examined. It is argued that, in general, fairness means machine closure. The notion of hyperfairness introduced by Attie, Francez, and Grumberg is generalized to arbitrary action systems. Also examined are the fairness criteria proposed by Apt, Francez, and Katz.
doi_str_mv 10.1007/PL00008921
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_27534059</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1017544411</sourcerecordid><originalsourceid>FETCH-LOGICAL-c287t-8a5f0664fd834f59d9db31ac5518a776b368c4734f931cd53ba0698d6454bf453</originalsourceid><addsrcrecordid>eNpd0DtLA0EQB_BFFDyjjaVVsLAQTvc1-yglJCocaKH1srcPvJDcnbu5It_elQQEpxmY-TEMf4SuCX4gGMvH9waXUpqSE1QRzmiNOdBTVGEiVU2lxOfoIud1QYwQWqGble1SH3Ke297Pv_ZjSPE4uURn0W5yuDr2GfpcLT8WL3Xz9vy6eGpqR5Xc1cpCxELw6BXjEbTXvmXEOgCirJSiZUI5LstOM-I8sNZioZUXHHgbObAZujvcHdPwPYW8M9suu7DZ2D4MUzZUAuMYdIG3_-B6mFJffjOUaAAhBS_o_oBcGnJOIZoxdVub9oZg85uR-cuI_QATCVXS</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>219556764</pqid></control><display><type>article</type><title>Fairness and hyperfairness</title><source>Springer Nature</source><creator>Lamport, Leslie</creator><creatorcontrib>Lamport, Leslie</creatorcontrib><description>The notion of fairness in trace-based formalisms is examined. It is argued that, in general, fairness means machine closure. The notion of hyperfairness introduced by Attie, Francez, and Grumberg is generalized to arbitrary action systems. Also examined are the fairness criteria proposed by Apt, Francez, and Katz.</description><identifier>ISSN: 0178-2770</identifier><identifier>EISSN: 1432-0452</identifier><identifier>DOI: 10.1007/PL00008921</identifier><language>eng</language><publisher>Heidelberg: Springer Nature B.V</publisher><ispartof>Distributed computing, 2000-11, Vol.13 (4), p.239-245</ispartof><rights>Springer-Verlag Berlin Heidelberg 2000</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c287t-8a5f0664fd834f59d9db31ac5518a776b368c4734f931cd53ba0698d6454bf453</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Lamport, Leslie</creatorcontrib><title>Fairness and hyperfairness</title><title>Distributed computing</title><description>The notion of fairness in trace-based formalisms is examined. It is argued that, in general, fairness means machine closure. The notion of hyperfairness introduced by Attie, Francez, and Grumberg is generalized to arbitrary action systems. Also examined are the fairness criteria proposed by Apt, Francez, and Katz.</description><issn>0178-2770</issn><issn>1432-0452</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><recordid>eNpd0DtLA0EQB_BFFDyjjaVVsLAQTvc1-yglJCocaKH1srcPvJDcnbu5It_elQQEpxmY-TEMf4SuCX4gGMvH9waXUpqSE1QRzmiNOdBTVGEiVU2lxOfoIud1QYwQWqGble1SH3Ke297Pv_ZjSPE4uURn0W5yuDr2GfpcLT8WL3Xz9vy6eGpqR5Xc1cpCxELw6BXjEbTXvmXEOgCirJSiZUI5LstOM-I8sNZioZUXHHgbObAZujvcHdPwPYW8M9suu7DZ2D4MUzZUAuMYdIG3_-B6mFJffjOUaAAhBS_o_oBcGnJOIZoxdVub9oZg85uR-cuI_QATCVXS</recordid><startdate>20001101</startdate><enddate>20001101</enddate><creator>Lamport, Leslie</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7RQ</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PKEHL</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><scope>U9A</scope></search><sort><creationdate>20001101</creationdate><title>Fairness and hyperfairness</title><author>Lamport, Leslie</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c287t-8a5f0664fd834f59d9db31ac5518a776b368c4734f931cd53ba0698d6454bf453</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lamport, Leslie</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Career and Technical Education (ProQuest Database)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied &amp; Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Distributed computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lamport, Leslie</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fairness and hyperfairness</atitle><jtitle>Distributed computing</jtitle><date>2000-11-01</date><risdate>2000</risdate><volume>13</volume><issue>4</issue><spage>239</spage><epage>245</epage><pages>239-245</pages><issn>0178-2770</issn><eissn>1432-0452</eissn><abstract>The notion of fairness in trace-based formalisms is examined. It is argued that, in general, fairness means machine closure. The notion of hyperfairness introduced by Attie, Francez, and Grumberg is generalized to arbitrary action systems. Also examined are the fairness criteria proposed by Apt, Francez, and Katz.</abstract><cop>Heidelberg</cop><pub>Springer Nature B.V</pub><doi>10.1007/PL00008921</doi><tpages>7</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0178-2770
ispartof Distributed computing, 2000-11, Vol.13 (4), p.239-245
issn 0178-2770
1432-0452
language eng
recordid cdi_proquest_miscellaneous_27534059
source Springer Nature
title Fairness and hyperfairness
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-24T01%3A58%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fairness%20and%20hyperfairness&rft.jtitle=Distributed%20computing&rft.au=Lamport,%20Leslie&rft.date=2000-11-01&rft.volume=13&rft.issue=4&rft.spage=239&rft.epage=245&rft.pages=239-245&rft.issn=0178-2770&rft.eissn=1432-0452&rft_id=info:doi/10.1007/PL00008921&rft_dat=%3Cproquest_cross%3E1017544411%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c287t-8a5f0664fd834f59d9db31ac5518a776b368c4734f931cd53ba0698d6454bf453%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=219556764&rft_id=info:pmid/&rfr_iscdi=true