On fairness and randomness
From MaRDI portal
Publication:840697
DOI10.1016/J.IC.2009.01.005zbMATH Open1170.93026OpenAlexW2006574755MaRDI QIDQ840697FDOQ840697
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
Recommendations
Foundations and philosophical topics in statistics (62A01) Stochastic systems in control theory (general) (93E03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of probabilistic verification
- Title not available (Why is that?)
- The definition of random sequences
- A unified approach to the definition of random sequences
- Appraising fairness in languages for distributed programming
- Title not available (Why is that?)
- Probabilities over rich languages, testing and randomness
- Title not available (Why is that?)
- Fairness and hyperfairness
- The axiomatization of randomness
- Probabilistic verification
- Logic for Programming, Artificial Intelligence, and Reasoning
- Title not available (Why is that?)
- CONCUR 2005 – Concurrency Theory
- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: On fairness and randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840697)