Fairness and hyperfairness

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.

[1]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[2]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[3]  Jayadev Misra.  Specifying Concurrent Objects as Communicating Processes , 1990, Sci. Comput. Program..

[4]  Nissim Francez,et al.  Generalized fair termination , 1984, POPL '84.

[5]  Martín Abadi,et al.  An old-fashioned recipe for real time , 1994, TOPL.

[6]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[7]  Bowen Alpern,et al.  Defining Liveness , 1984, Inf. Process. Lett..

[8]  Martín Abadi,et al.  The Existence of Refinement Mappings , 1988, LICS.

[9]  A. Prasad Sistla,et al.  Can Message Buffers Be Axiomatized in Linear Temporal Logic? , 1984, Inf. Control..

[10]  Fred B. Schneider,et al.  On concurrent programming , 1997, CACM.

[11]  Leslie Lamport,et al.  Artificial Intelligence and Language Processing ]acques Cohen Editor a Simple Approach to Specifying Concurrent Systems , 2022 .

[12]  Ralph-Johan Back,et al.  Decentralization of process nets with centralized control , 1983, PODC '83.

[13]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[14]  Leslie Lamport,et al.  win and sin: predicate transformers for concurrency , 1990, TOPL.

[15]  Martín Abadi,et al.  Composing Specifications , 1989, REX Workshop.

[16]  F. Grund,et al.  Wirth, N., Programming in Modula-2. Berlin etc., Springer-Verlag 1985. 3rd corr. ed., IV, 202 pp., 4 figs., DM 49,50. ISBN 3-540-15078-1 (Texts and Monographs in Computer Science) , 1988 .