Information Processing Letters
Petri nets: an introduction
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
The existence of refinement mappings
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Fairness, distances and degrees
Theoretical Computer Science
On topological characterization of behavioural properties
Topology and category theory in computer science
Handbook of logic in computer science (vol. 1)
The complexity of probabilistic verification
Journal of the ACM (JACM)
A temporal logic for proving properties of topologically general executions
Information and Computation
On the verification of qualitative properties of probabilistic processes under fairness constraints
Information Processing Letters
On fairness notions in distributed systems I.4: a characterization of implementability
Information and Computation
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Automatic Verification of Probabilistic Free Choice
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Localizability of Fairness Constraints and Their Distributed Implementations
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Local Liveness for Compositional Modeling of Fair Reactive Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Proceedings of the Conference on Logic of Programs
The Planning Spectrum - One, Two, Three, Infinity
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Distributed Computing
Fairness and hyperfairness in multi-party interactions
Distributed Computing
CONCUR 2005 - Concurrency Theory
Memoryful Branching-Time Logic
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Temporal Logics and Model Checking for Fairly Correct Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations 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
On conspiracies and hyperfairness in distributed computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Fair adversaries and randomization in two-player games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Hi-index | 0.00 |
We define when a linear-time temporal property is a fairness property with respect to a given system. This captures the essence shared by most fairness assumptions that are used in the specification and verification of reactive and concurrent systems, such as weak fairness, strong fairness, k-fairness, and many others. We provide three characterizations of fairness: a language-theoretic, a game-theoretic, and a topological characterization. It turns out that the fairness properties are the sets that are “large” from a topological point of view, that is, they are the co-meager sets in the natural topology of runs of a given system. This insight provides a link to probability theory where a set is “large” when it has measure 1. While these two notions of largeness are similar, they do not coincide in general. However, we show that they coincide for ω-regular properties and bounded Borel measures. That is, an ω-regular temporal property of a finite-state system has measure 1 under a bounded Borel measure if and only if it is a fairness property with respect to that system. The definition of fairness leads to a generic relaxation of correctness of a system in linear-time semantics. We define a system to be fairly correct if there exists a fairness assumption under which it satisfies its specification. Equivalently, a system is fairly correct if the set of runs satisfying the specification is topologically large. We motivate this notion of correctness and show how it can be verified in a system.