scientific article

zbMath1271.68192MaRDI QIDQ2847403

Joël Ouaknine, Michael W. Mislove, James Worrell

Publication date: 9 September 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104050297

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (23)

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 ⋮ Convexity via Weak Distributive Laws ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Axiomatizations for probabilistic finite-state behaviors ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ A Probabilistic Applied Pi–Calculus ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Data Refinement with Probability in Mind ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ A trustful monad for axiomatic reasoning with probability and nondeterminism ⋮ Quantitative Kleene coalgebras ⋮ Making random choices invisible to the scheduler ⋮ Unnamed Item ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ Unnamed Item ⋮ Simulation Hemi-metrics between Infinite-State Stochastic Games ⋮ 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 ⋮ Remarks on Testing Probabilistic Processes ⋮ Proving Approximate Implementations for Probabilistic I/O Automata ⋮ Probabilistic Completion of Nondeterministic Models

This page was built for publication: