Bonchi, F; Silva, A; Sokolova, A; (2017) The power of convex algebras. In: Meyer, R and Nestmann, U, (eds.) 28th International Conference on Concurrency Theory (CONCUR 2017). (pp. 23:1-23:18). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany.

Preview

Text The power of convex algebras.pdf - Published Version Download (681kB) | Preview

Abstract

Probabilistic automata (PA) combine probability and nondeterminism. They can be given different semantics, like strong bisimilarity, convex bisimilarity, or (more recently) distribution bisimilarity. The latter is based on the view of PA as transformers of probability distributions, also called belief states, and promotes distributions to first-class citizens. We give a coalgebraic account of the latter semantics, and explain the genesis of the beliefstate transformer from a PA. To do so, we make explicit the convex algebraic structure present in PA and identify belief-state transformers as transition systems with state space that carries a convex algebra. As a consequence of our abstract approach, we can give a sound proof technique which we call bisimulation up-to convex hull.

Download activity - last month

Export as XMLCSVJSON

Download activity - last 12 months

Export as JSONXMLCSV

Downloads by country - last 12 months

Export as XMLCSVJSON

Archive Staff Only

View Item