Recommendations
Cited in
(36)- Non-Archimedean probability: Frequency and axiomatics theories
- Complete axiomatization for the total variation distance of Markov chains
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Discrete random variables over domains
- Axiomatizing weighted synchronization trees and weighted bisimilarity
- Domain equations for probabilistic processes
- A posteriori conditional general expected value with product-product operation in nondeterministic decision processes
- Remarks on testing probabilistic processes
- Proving approximate implementations for probabilistic I/O automata
- Data refinement with probability in mind
- Deriving Syntax and Axioms for Quantitative Regular Behaviours
- A Probabilistic Applied Pi–Calculus
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- scientific article; zbMATH DE number 17696 (Why is no real title available?)
- scientific article; zbMATH DE number 1231591 (Why is no real title available?)
- scientific article; zbMATH DE number 1324656 (Why is no real title available?)
- scientific article; zbMATH DE number 1759622 (Why is no real title available?)
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
- Convexity via Weak Distributive Laws
- Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
- The theory of traces for systems with nondeterminism, probability, and termination
- A trustful monad for axiomatic reasoning with probability and nondeterminism
- Probabilistic completion of nondeterministic models
- Quantitative Kleene coalgebras
- Simulation Hemi-metrics between Infinite-State Stochastic Games
- Probability and Nondeterminism in Operational Models of Concurrency
- Infinite choice and probability distributions. An open problem: the real hotel
- Monads for measurable queries in probabilistic databases
- A general completeness theorem for skip-free star algebras
- A completeness theorem for probabilistic regular expressions
- Multisets and distributions
- Axiomatizations for probabilistic finite-state behaviors
- Making random choices invisible to the scheduler
This page was built for publication: Axioms for probability and nondeterminism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2847403)
