Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems

DOI10.2168/LMCS-9(4:16)2013zbMath1314.68188arXiv1310.7417OpenAlexW2061164145MaRDI QIDQ2871468

Barbara König, Henning Kerstan

Publication date: 8 January 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.7417

zbMATH Keywords

coalgebraMarkov processesprobabilistic transition systemstrace semantics

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50)

Related Items (9)

Generic weakest precondition semantics from monads enriched with order ⋮ Behavioural equivalences for coalgebras with unobservable moves ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantitative simulations by matrices ⋮ (in)finite trace equivalence of probabilistic transition systems ⋮ Unnamed Item ⋮ Probabilistic mediator: a coalgebraic perspective

This page was built for publication: Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems