scientific article; zbMATH DE number 1759622

zbMath0999.68147MaRDI QIDQ4536613

Michael W. Mislove

Publication date: 25 June 2002

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (20)

A denotational semantics for low-level probabilistic programs with nondeterminism ⋮ Discrete random variables over domains ⋮ Discrete Lawvere theories and computational effects ⋮ Convex lattice equation systems ⋮ Isomorphism theorems between models of mixed choice ⋮ Closures in Binary Partial Algebras ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ Topological cones: functional analysis in a \(T_{0}\)-setting ⋮ A trustful monad for axiomatic reasoning with probability and nondeterminism ⋮ A monad for randomized algorithms ⋮ Anatomy of a domain of continuous random variables. I ⋮ Coproducts of Ideal Monads ⋮ Anatomy of a Domain of Continuous Random Variables II ⋮ Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice ⋮ Combining effects: sum and tensor ⋮ Unnamed Item ⋮ Prevision Domains and Convex Powercones ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability ⋮ Remarks on Testing Probabilistic Processes ⋮ Probabilistic Completion of Nondeterministic Models

This page was built for publication: