Coalgebraic Trace Semantics for Continuous Probabilistic Transition ...


Henning Kerstan and Barbara König. Coalgebraic trace semantics for continuous probabilistic transition systems. Logical Methods in Computer Science, 9 [4:16](834), dec 2013.


Coalgebras in a Kleisli category yield a generic definition of trace semantics for various types of labelled transition systems. In this paper we apply this generic theory to generative probabilistic transition systems, short PTS, with arbitrary (possibly uncountable) state spaces. We consider the sub-probability monad and the probability monad (Giry monad) on the category of measurable spaces and measurable functions. Our main contribution is that the existence of a final coalgebra in the Kleisli category of these monads is closely connected to the measure-theoretic extension theorem for sigma-finite pre-measures. In fact, we obtain a practical definition of the trace measure for both finite and infinite traces of PTS that subsumes a well-known result for discrete probabilistic transition systems. Finally we consider two example systems with uncountable state spaces and apply our theory to calculate their trace measures.


trace semantics, probabilistic transition system

Suggested BibTeX entry:

    author = {Henning Kerstan and Barbara K{\"o}nig},
    journal = {Logical Methods in Computer Science},
    month = {dec},
    number = {834},
    title = {Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems},
    volume = {9 [4:16]},
    year = {2013}

This work is not available online here.
© University of Duisburg-Essen, Theoretical Computer Science group