On fairness and randomness
From MaRDI portal
Publication:840697
DOI10.1016/j.ic.2009.01.005zbMath1170.93026OpenAlexW2006574755MaRDI QIDQ840697
Publication date: 14 September 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.01.005
Foundations and philosophical topics in statistics (62A01) Stochastic systems in control theory (general) (93E03)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Appraising fairness in languages for distributed programming
- Probabilistic verification
- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- Probabilities over rich languages, testing and randomness
- The complexity of probabilistic verification
- Fairness and hyperfairness
- The axiomatization of randomness
- A unified approach to the definition of random sequences
- The definition of random sequences
- Logic for Programming, Artificial Intelligence, and Reasoning
- CONCUR 2005 – Concurrency Theory
This page was built for publication: On fairness and randomness