A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Eilenberg--Moore algebras for stochastic relations
Information and Computation
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Labelled Markov Processes
| Hi-index | 0.00 |
So-called effect algebras and modules are basic mathematical structures that were first identified in mathematical physics, for the study of quantum logic and quantum probability. They incorporate a double negation law $p^{\perp\perp} = p. Since then it has been realised that these effect structures form a useful abstraction that covers not only quantum logic, but also Boolean logic and probabilistic logic. Moreover, the duality between effect and convex structures lies at the heart of the duality between predicates and states. These insights are leading to a uniform framework for the semantics of computation and logic. This framework has been elaborated elsewhere for set-theoretic, discrete probabilistic, and quantum computation. Here the missing case of continuous probability is shown to fit in the same uniform framework. On a technical level, this involves an investigation of the logical aspects of the Giry monad on measurable spaces and of Lebesgue integration.