Continuous previsions. (English) Zbl 1179.68074
Duparc, Jacques (ed.) et al., Computer science logic. 21st international workshop, CSL 2007, 16th annual conference of the EACSL, Lausanne, Switzerland, September 11–15, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74914-1/pbk). Lecture Notes in Computer Science 4646, 542-557 (2007).
Summary: We define strong monads of continuous (lower, upper) previsions, and of forks, modeling both probabilistic and nondeterministic choice. This is an elegant alternative to recent proposals by Mislove, Tix, Keimel, and Plotkin. We show that our monads are sound and complete, in the sense that they model exactly the interaction between probabilistic and (demonic, angelic, chaotic) choice.
For the entire collection see [Zbl 1122.68006].
For the entire collection see [Zbl 1122.68006].
MSC:
| 68Q55 | Semantics in the theory of computing |
| 06B35 | Continuous lattices and posets, applications |
| 18C15 | Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads |
| 91A15 | Stochastic games, stochastic differential games |
| 91A80 | Applications of game theory |
