(in)finite trace equivalence of probabilistic transition systems
From MaRDI portal
Publication:1798789
DOI10.1007/978-3-030-00389-0_7OpenAlexW2890034443MaRDI QIDQ1798789
Publication date: 23 October 2018
Full work available at URL: http://hdl.handle.net/2066/197615
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general account of coinduction up-to
- Probabilistic systems coalgebraically: a survey
- Universal coalgebra: A theory of systems
- Trace semantics via determinization
- Probability theory. A comprehensive course.
- Introduction to Coalgebra
- Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
- Checking NFA equivalence with bisimulations up to congruence
- Weighted Bisimulation in Linear Algebraic Form
- Up-To Techniques for Weighted Systems
- From Branching to Linear Time, Coalgebraically
- Generalizing determinization from automata to coalgebras
- Coalgebraic Infinite Traces and Kleisli Simulations
- Generic Trace Semantics via Coinduction
- Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems
This page was built for publication: (in)finite trace equivalence of probabilistic transition systems
