Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
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 s...
Main Authors: | Henning Kerstan, Barbara König |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2013-12-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/859/pdf |
Similar Items
-
Coalgebraic Behavioral Metrics
by: Paolo Baldan, et al.
Published: (2018-09-01) -
Coalgebraic Semantics for Probabilistic Logic Programming
by: Tao Gu, et al.
Published: (2021-04-01) -
A coalgebraic treatment of conditional transition systems with upgrades
by: Harsh Beohar, et al.
Published: (2018-02-01) -
Coalgebraic Infinite Traces and Kleisli Simulations
by: Natsuki Urabe, et al.
Published: (2018-09-01) -
Coalgebraic trace semantics via forgetful logics
by: Bartek Klin, et al.
Published: (2017-04-01)