On fairness and randomness
From MaRDI portal
Publication:840697
Recommendations
Cites work
- scientific article; zbMATH DE number 4153903 (Why is no real title available?)
- scientific article; zbMATH DE number 4060392 (Why is no real title available?)
- scientific article; zbMATH DE number 3735115 (Why is no real title available?)
- scientific article; zbMATH DE number 1324655 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1948169 (Why is no real title available?)
- A unified approach to the definition of random sequences
- Appraising fairness in languages for distributed programming
- CONCUR 2005 – Concurrency Theory
- Fairness and hyperfairness
- Logic for Programming, Artificial Intelligence, and Reasoning
- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- Probabilistic verification
- Probabilities over rich languages, testing and randomness
- The axiomatization of randomness
- The complexity of probabilistic verification
- The definition of random sequences
Cited in
(6)- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- Defining fairness in reactive and concurrent systems
- scientific article; zbMATH DE number 741350 (Why is no real title available?)
- Liveness Reasoning with Isabelle/HOL
- Symmetry in domination for hypergraphs with choice
- New perspectives on fairness.
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)