Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Stochastic Relations
Labelled Markov Processes
Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Final sequences and final coalgebras for measurable spaces
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
A coalgebraic perspective on minimization and determinization
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On the complexity of computing probabilistic bisimilarity
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Hi-index | 0.00 |
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.