Prevision Domains and Convex Powercones

DOI10.1007/978-3-540-78499-9_23zbMath1139.68034OpenAlexW2152610855MaRDI QIDQ5458368

Jean Goubault-Larrecq

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_23

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35)

Related Items (13)

Layout randomization and nondeterminism ⋮ Observationally-induced algebras in domain theory ⋮ Convex lattice equation systems ⋮ Isomorphism theorems between models of mixed choice ⋮ Healthiness conditions for predicate transformers ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ De Groot duality and models of choice: angels, demons and nature ⋮ Layout Randomization and Nondeterminism ⋮ Weak topologies and compactness in asymmetric functional analysis ⋮ Simulation Hemi-metrics between Infinite-State Stochastic Games ⋮ Prevision Domains and Convex Powercones ⋮ Approximating Markov Processes by Averaging ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability

Cites Work

• Retracted: Semantic domains for combining probability and non-determinism
• Domain theory and integration
• Topology, domain theory and theoretical computer science
• Continuous Previsions
• Continuous Lattices and Domains
• Continuous Capacities on Continuous State Spaces
• Prevision Domains and Convex Powercones
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Prevision Domains and Convex Powercones