The following pages link to (Q2847403):
Displaying 23 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (Q478400) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
- Making random choices invisible to the scheduler (Q979081) (← links)
- Complete axiomatization for the total variation distance of Markov chains (Q2130580) (← links)
- A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
- Discrete random variables over domains (Q2373745) (← links)
- Axiomatizing weighted synchronization trees and weighted bisimilarity (Q2447752) (← links)
- Remarks on Testing Probabilistic Processes (Q2864156) (← links)
- Proving Approximate Implementations for Probabilistic I/O Automata (Q2864525) (← links)
- Data Refinement with Probability in Mind (Q2994495) (← links)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
- A Probabilistic Applied Pi–Calculus (Q3498438) (← links)
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)
- (Q4558787) (← links)
- Convexity via Weak Distributive Laws (Q5060194) (← links)
- Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular (Q5079754) (← links)
- Monads and Quantitative Equational Theories for Nondeterminism and Probability (Q5089294) (← links)
- (Q5094151) (← links)
- A trustful monad for axiomatic reasoning with probability and nondeterminism (Q5152658) (← links)
- Probabilistic Completion of Nondeterministic Models (Q5262931) (← links)
- Simulation Hemi-metrics between Infinite-State Stochastic Games (Q5458350) (← links)
