Fairness
Information and Software Technology
A hierarchy of temporal properties (invited paper, 1989)
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
On the development of reactive systems
Logics and models of concurrent systems
The existence of refinement mappings
Theoretical Computer Science
On topological characterization of behavioural properties
Topology and category theory in computer science
On characterization of safety and liveness properties in temporal logic
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Formal Foundation for Specification and Verification
Distributed Systems: Methods and Tools for Specification, An Advanced Course, April 3-12, 1984 and April 16-25, 1985 Munich
Distributed Computing
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
An Approach to Modelling and Verification of Component Based Systems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Information and Computation
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Model checking almost all paths can be less expensive than checking all paths
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A tranformational approach for designing scheduler-oblivious self-stabilizing algorithms
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Fair adversaries and randomization in two-player games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Model checking with fairness assumptions using PAT
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 0.00 |
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.