Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Information and Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
On the verification of qualitative properties of probabilistic processes under fairness constraints
Information Processing Letters
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Completing the Temporal Picture
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
Trading Probability for Fairness
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Distributed Computing
Recognizing ?-regular Languages with Probabilistic Automata
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
CONCUR 2005 - Concurrency Theory
Temporal Logics and Model Checking for Fairly Correct Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We investigate the relation between the behavior of non-deterministic systems under fairness constraints, and the behavior of probabilistic systems. To this end, first a framework based on computable stopping strategies is developed that provides a common foundation for describing both fair and probabilistic behavior. On the basis of stopping strategies it is then shown that fair behavior corresponds in a precise sense to random behavior in the sense of Martin-Lof's definition of randomness. We view probabilistic systems as concrete implementations of more abstract non-deterministic systems. Under this perspective the question is investigated what probabilistic properties are needed in such an implementation to guarantee (with probability one) certain required fairness properties in the behavior of the probabilistic system. Generalizing earlier concepts of @e-bounded transition probabilities, we introduce the notion of divergent probabilistic systems, which enables an exact characterization of the fairness properties of a probabilistic implementation. Looking beyond pure fairness properties, we also investigate what other qualitative system properties are guaranteed by probabilistic implementations of fair non-deterministic behavior. This leads to a completeness result which generalizes a well-known theorem by Pnueli and Zuck.