Javascript must be enabled to continue!
Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
View through CrossRef
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.
Centre pour la Communication Scientifique Directe (CCSD)
Title: Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
Description:
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.
Related Results
Inventory and pricing management in probabilistic selling
Inventory and pricing management in probabilistic selling
Context: Probabilistic selling is the strategy that the seller creates an additional probabilistic product using existing products. The exact information is unknown to customers u...
EXPTIME Tableaux for the Coalgebraic mu-Calculus
EXPTIME Tableaux for the Coalgebraic mu-Calculus
The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and ...
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective
Notions of simulation, among other uses, provide a computationally tractable and sound (but not necessarily complete) proof method for language inclusion. They have been comprehens...
Fertility Transition Across Major Sub-Saharan African Cities: The Role of Proximate Determinants
Fertility Transition Across Major Sub-Saharan African Cities: The Role of Proximate Determinants
Abstract
Background
Sub-Saharan Africa’s fertility transition has lagged behind other regions despite rapid urbanization, resulting in persistently high fertility rates. S...
Linear-time logics -- a coalgebraic perspective
Linear-time logics -- a coalgebraic perspective
We describe a general approach to deriving linear-time logics for a wide
variety of state-based, quantitative systems, by modelling the latter as
coalgebras whose type incorporates...
Trace Elements in Deep-Sea Black (Antipatharian) Coral Skeletons
Trace Elements in Deep-Sea Black (Antipatharian) Coral Skeletons
<p><b>The proteinaceous skeletons of deep-sea Antipatharian 'black' corals are a new proxy archive that has shown promise for providing high resolution marine records i...
Complexity Results for Probabilistic Datalog
Complexity Results for Probabilistic Datalog
We study the query evaluation problem in probabilistic databases in the presence of probabilistic existential rules. Our focus is on the Datalog±family of languages for ...
The Formal Semantics of Programming Languages
The Formal Semantics of Programming Languages
The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming la...

