Rajeev Alur, Thomas A. Henzinger  Home/Search
Context Related
| upenn.edu/~alur/Lics94.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~alur/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Fairness is a mathematical abstraction: in a multiprogramming environment, fairness abstracts the details of admissible ("fair") schedulers; in a distributed environment, fairness abstracts the independent processor speeds. We argue that the standard definition of fairness often is unnecessarily weak and can be replaced by the stronger, yet still abstract, notion of finitary fairness. While standard weak fairness requires that no enabled transition is postponed forever, finitary weak fairness... (Update)
Context of citations to this paper: More
...critically depend on the level of fairness inherent in the system. There are other fairness notions, too. For example finitary fairness [5] requires that for every execution of the system there is an unknown bound k such that no enabled action is postponed more than k...
...the design of algorithms for problems that are unsolvable in the asynchronous model. The notion of finitary fairness was introduced in [2]. Finitary fairness requires that for every run of a system there is an unknown bound k such that no enabled transition is postponed more...
Cited by: More
Discounting the Future in Systems Theory - de Alfaro, Henzinger, Majumdar (2003) (Correct)
Verification Methods for the Divergent Runs Of Clock Systems - A.Henzinger, W.Kopke (1994) (Correct)
From Fairness to Chance - de Alfaro (1999) (Correct)
Similar documents (at the sentence level):
56.8%: Finitary Fairness - Rajeev Alur University (1994) (Correct)
Active bibliography (related documents): More All
0.2: Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert (Correct)
0.2: Efficiency of Partial Synchrony, and Resource Allocation in.. - Rhee (1994) (Correct)
0.1: Bounds on the Time to Reach Agreement in the.. - Attiya, Dwork.. (1994) (Correct)
Similar documents based on text: More All
0.3: Supersolubility and Finitary Groups - Pinnock (2000) (Correct)
0.3: Hybrid Automata with Finite Bisimulations - Henzinger (1995) (Correct)
0.2: Real-time System = Discrete System + Clock Variables - Alur, Henzinger (1997) (Correct)
Related documents from co-citation: More All
3: The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
2: Springer-Verlag (context) - Francez - 1986
2: Automatic verification of probabilistic concurrent finite-state systems (context) - Vardi - 1985
BibTeX entry: (Update)
R. Alur and T. Henzinger. Finitary fairness. In Proc. of the 9th Annual IEEE Symp. on Logic in Computer Science, pages 52--61, Paris, France, July 1994. IEEE Comp. Soc. Press. http://citeseer.ist.psu.edu/article/alur94finitary.html More
@article{ alur98finitary,
author = "Rajeev Alur and Thomas A. Henzinger",
title = "Finitary fairness",
journal = "ACM Transactions on Programming Languages and Systems",
volume = "20",
number = "6",
pages = "1171--1194",
year = "1998",
url = "citeseer.ist.psu.edu/article/alur94finitary.html" }
Citations (may not include all citations):1180 The temporal logic of reactive and concurrent systems (context) - Manna, Pnueli - 1991
739 Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
666 Theoretical Computer Science (context) - Alur, Dill et al. - 1994
374 Automata on infinite objects (context) - Thomas - 1990
256 Reaching agreement in the presence of faults (context) - Pease, Shostak et al. - 1980
231 Information Processing Letters (context) - Alpern, Schneider - 1985
231 Information Processing Letters (context) - Alpern, Demers et al. - 1986
214 Consensus in the presence of partial synchrony - Dwork, Lynch et al. - 1988
163 the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
111 Springer-Verlag (context) - Francez - 1986
92 Memory requirements for agreement among unreliable asynchron.. (context) - Loui, Abu-Amara - 1987
90 Time constrained automata - Merritt, Modugno et al. - 1991
75 Parametric real-time reasoning - Alur, Henzinger et al. - 1993
56 Appraising fairness in languages for distributed programming (context) - Apt, Francez et al. - 1988
48 A hierarchy of temporal properties (context) - Manna, Pnueli - 1990
35 Temporal proof methodologies for timed transition systems - Henzinger, Manna et al. - 1994
34 Computer-aided verification (context) - Clarke, Kurshan - 1996
18 Verification of concurrent programs: the automata-theoretic .. - Vardi - 1987
16 Time-adaptive algorithms for synchronization - Alur, Attiya et al. - 1997
13 and fairness: The ethics of concurrent termination (context) - Lehman, Pnueli et al. - 1982
8 The impact of time on the session problem (context) - Rhee, Welch - 1992
1 of Illinois at Urbana-Champaign (context) - Jayasimha, Synchronization et al. - 1988
Documents on the same site (http://www.cis.upenn.edu/~alur/pub.html): More
Parametric Real-time Reasoning - Alur, Henzinger, Vardi (1993) (Correct)
Modularity for Timed and Hybrid Systems - Alur, Henzinger (1997) (Correct)
A Really Temporal Logic - Alur, Henzinger (1989) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC