On fairness and randomness

Baier, 1998, On the verification of qualitative properties of probabilistic processes under fairness constraints, Information Processing Letters, 66, 71, 10.1016/S0020-0190(98)00038-6 A. Pnueli, On the extremely fair treatment of probabilistic algorithms, in: Proceedings of the 18th IEEE Symposium on Foundation of Computer Science, 1983. Pnueli, 1993, Probabilistic verification, Information and Computation, 103, 1, 10.1006/inco.1993.1012 L. de Alfaro, From fairness to chance, Electronic Notes in Theoretical Computer Science, 22. Martin-Löf, 1966, The definition of random sequences, Information and Control, 9, 602, 10.1016/S0019-9958(66)80018-9 Schnorr, 1971, A unified approach to the definition of random sequences, Mathematical Systems Theory, 5, 246, 10.1007/BF01694181 Gaifman, 1982, Probabilities over rich languages, testing and randomness, Journal of Symbolic Logic, 47, 495, 10.2307/2273587 L. Lamport, Sometime is sometimes Not Never, in: Conference Record of the Seventh ACM Symposium on Principles of Programming Languages (POPL’80), ACM Press, 1980. D. Lehmann, A. Pnueli, J. Stavi, Impartiality, justice and fairness: the ethics of concurrent termination, in: S. Even, O. Kariv (Eds.), Proceedings of ICALP-81, vol. 115 of Lecture Notes in Computer Science, Springer, 1981, pp. 264–277. Z. Manna, A. Pnueli, Completing the temporal picture, in: G. Ausiello, M. Dezani-Ciancaglini, S.R.D. Rocca (Eds.), Automata, Languages, and Programming: 16th International Colloquim, ICALP 89, 1989, pp. 534–558. Apt, 1988, Appraising fairness in languages for distributed programming, Distributed Computing, 2, 226, 10.1007/BF01872848 B. Aminof, T. Ball, O. Kupferman, Reasoning about systems with transition fairness, in: F. Baader, A. Voronkov (Eds.), Proceedings of LPAR-04, vol. 3452 of LNCS, 2005, pp. 194–208. Lamport, 2000, Fairness and hyperfairness, Distributed Computing, 13, 239, 10.1007/PL00008921 H. Völzer, D. Varacca, E. Kindler, Defining fairness, in: M. Abadi, L. de Alfaro (Eds.), Proceedings of CONCUR-05, vol. 3653 of LNCS, 2005, pp. 458–472. D. Varacca, H. Völzer, Temporal logics and model checking for fairly correct systems, in: LICS’06: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society, 2006, pp. 389–398. M. Jaeger, Fairness, computable fairness and randomness, in: Proceedings of the 2nd International Workshop on Probabilistic Methods in Verification (PROBMIV-99), Technical Report CSR-99-8, School of Computer Science, University of Birmingham, Eindhoven, Netherlands, 1999, pp. 57–66. von Mises, 1919, Grundlagen der wahrscheinlichkeitsrechnung, Mathematische Zeitschrift, 5, 52, 10.1007/BF01203155 van Lambalgen, 1990, The axiomatization of randomness, The Journal of Symbolic Logic, 55, 1143, 10.2307/2274480 Li, 1997 Billingsley, 1986 Thomas, 1990, Automata on infinite objects, vol. 2 Emerson, 1990, Temporal and modal logic, vol. 2 Courcoubetis, 1995, The complexity of probabilistic verification, Journal of the ACM, 42, 857, 10.1145/210332.210339 M.Y. Vardi, Probabilistic linear-time model checking: an overview of the automata-theoretic approach, in: J.-P. Katoen (Ed.), Formal methods for real-time and probabilistic systems (ARTS-99): 5th International AMAST Workshop, vol. 1601 of LNCS, 1999. C. Baier, M. G.er, Recognizing ω-regular languages with probabilistic automata, in: LICS’05: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science, 2005, pp. 137–146. M. Jurdzinski, O. Kupferman, T. Henzinger, Trading probability for fairness, in: Proceedings of CSL-02, 2002.