Abstract
We propose a definition for the class of all fairness properties of a given system. We provide independent characterizations in terms of topology, language theory and game theory. All popular notions of fairness from the literature satisfy our definition. Moreover our class is closed under union and countable intersection, and it is, in a sense, the maximal class having this property. On the way, we characterize a class of liveness properties, called constructive liveness, which is interesting by itself because it is also closed under union and countable intersection. Furthermore, we characterize some subclasses of liveness that are closed under arbitrary intersection.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abadi, M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science 82, 253–284 (1991)
Alpern, B., Schneider, F.B.: Defining liveness. IPL 21, 181–185 (1985)
Apt, K.R., Francez, N., Katz, S.: Appraising fairness in languages for distributed programming. Distributed Computing 2, 226–241 (1988)
Francez, N.: Fairness. Springer, Heidelberg (1986)
Grädel, E.: Positional determinacy of infinite games. In: STAGS, pp. 4–18 (2004)
Harel, D., Pnueli, A.: On the development of reactive systems. In: Apt, K. (ed.) Logics and Models of Concurrent Systems, pp. 477–498. Springer, Heidelberg (1985)
Kindler, E.: Safety and liveness properties: A survey. EATCS Bulletin, vol. 53 (1994)
Kwiatkowska, M.Z.: Survey of fairness notions. Information and Software Technology 31(7), 371–386 (1989)
Kwiatkowska, M.Z.: On topological characterization of behavioural properties. Topology and Category Theory in Computer Science, Oxford Univ. Press (1991)
Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering 3(2), 125–143 (1977)
Lamport, L.: Formal foundation for specification and verification. In: Alford, M.W., Hommel, G., Schneider, F.B., Ansart, J.P., Lamport, L., Mullery, G.P., Liskov, B. (eds.) Distributed Systems. LNCS, vol. 190. Springer, Heidelberg (1985)
Lamport, L.: Fairness and hyperfairness. Distr. Computing 13(4), 239–245 (2000)
Lehmann, D., Pnueli, A., Stavi, J.: Impartiality, justice, and fairness: The ethics of concurrent termination. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 264–277. Springer, Heidelberg (1981)
Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: 9th PODC, pp. 377–408. ACM, New York (1990)
Oxtoby, J.C.: Measure and Category. A Survey of the Analogies between Topological and Measure Spaces. Springer, Heidelberg (1971)
Sistla, A.P.: On characterization of safety and liveness properties in temporal logic. In: 4th PODC, pp. 39–48. ACM, New York (1985)
Völzer, H., Varacca, D., Kindler, E. : Defining Fairness. SIIM Technical Report SIIM-TR-A-05-18, Universität zu Lübeck (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Völzer, H., Varacca, D., Kindler, E. (2005). Defining Fairness. In: Abadi, M., de Alfaro, L. (eds) CONCUR 2005 – Concurrency Theory. CONCUR 2005. Lecture Notes in Computer Science, vol 3653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539452_35
Download citation
DOI: https://doi.org/10.1007/11539452_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28309-6
Online ISBN: 978-3-540-31934-4
eBook Packages: Computer ScienceComputer Science (R0)