Presenting convex sets of probability distributions by convex semilattices and unique bases

We prove that every finitely generated convex set of finitely supported probability distributions has a unique base, and use this result to show that the monad of convex sets of probability distributions is presented by the algebraic theory of convex semilattices.

[1]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

[2]  Doina Precup,et al.  Equivalence Relations in Fully and Partially Observable Markov Decision Processes , 2009, IJCAI.

[3]  Christel Baier,et al.  Principles of model checking , 2008 .

[4]  Klaus Keimel,et al.  Semantic Domains for Combining Probability and Non-Determinism , 2005, Electronic Notes in Theoretical Computer Science.

[5]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[7]  Bart Jacobs,et al.  Convexity, Duality and Effects , 2010, IFIP TCS.

[8]  Daniele Varacca,et al.  Probability, Nondeterminism and Concurrency: Two Denotational Models for Probabilistic Computation , 2003 .

[9]  Hans A. Hansson.  Time and probability in formal design of distributed systems , 1991, DoCS.

[10]  Zbigniew Semadeni,et al.  Monads and their Eilenberg-Moore algebras in functional analysis , 1973 .

[11]  Ernst-Erich Doberkat,et al.  Eilenberg-Moore algebras for stochastic relations , 2006, Inf. Comput..

[12]  Ohad Kammar,et al.  Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[13]  Sebastian Junges,et al.  A Storm is Coming: A Modern Probabilistic Model Checker , 2017, CAV.

[14]  Jean Goubault-Larrecq.  Prevision Domains and Convex Powercones , 2008, FoSSaCS.

[15]  Klaus Keimel,et al.  Mixed powerdomains for probability and nondeterminism , 2016, Log. Methods Comput. Sci..

[16]  Bart Jacobs,et al.  Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems , 2008, CMCS.

[17]  Matteo Mio,et al.  Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus , 2014, FoSSaCS.

[18]  Holger Hermanns,et al.  Probabilistic Bisimulation: Naturally on Distributions , 2014, CONCUR.

[19]  Ana Sokolova,et al.  The Theory of Traces for Systems with Nondeterminism and Probability , 2018, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[20]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[21]  Lijun Zhang,et al.  Probabilistic Logical Characterization , 2011, Inf. Comput..

[22]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[23]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

[24]  Ernst-Erich Doberkat.  Erratum and Addendum: Eilenberg-Moore algebras for stochastic relations , 2008, Inf. Comput..

[25]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[26]  Ohad Kammar,et al.  A convenient category for higher-order probability theory , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).