Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory
DOI10.1007/978-3-642-32940-1_29zbMATH Open1364.68289OpenAlexW1752709585MaRDI QIDQ2912693FDOQ2912693
Authors: Henning Kerstan, Barbara König 
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32940-1_29
Recommendations
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Sound and complete axiomatization of trace semantics for probabilistic systems
- Probabilistic systems coalgebraically: a survey
- Trace semantics for coalgebras
- Coalgebraic semantics for probabilistic logic programming
- (In)finite trace equivalence of probabilistic transition systems
- The theory of traces for systems with nondeterminism, probability, and termination
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Eilenberg-Moore and Kleisli constructions for monads (18C20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (4)
- ``Keep definition, change category -- a practical approach to state-based system calculi
- Sound and complete axiomatization of trace semantics for probabilistic systems
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Coalgebraic trace semantics for continuous probabilistic transition systems
This page was built for publication: Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912693)
