(in)finite trace equivalence of probabilistic transition systems
type: Item
instance of: scholarly article
title: (in)finite trace equivalence of probabilistic transition systems
DOI: 10.1007/978-3-030-00389-0_7
author: Alexandre Goy
author: Jurriaan Rot
publication date: 2018-10-23T00:00:00Z
full work available at URL: http://hdl.handle.net/2066/197615
Mathematics Subject Classification ID: 68Q65
zbMATH DE Number: 6962934
MaRDI profile type: Publication
OpenAlex ID: W2890034443
cites work: Q5386174
cites work: Up-To Techniques for Weighted Systems
cites work: A general account of coinduction up-to
cites work: Checking NFA equivalence with bisimulations up to congruence
cites work: Q5111636
cites work: Weighted Bisimulation in Linear Algebraic Form
cites work: From Branching to Linear Time, Coalgebraically
cites work: Q3946875
cites work: Generic Trace Semantics via Coinduction
cites work: Introduction to coalgebra. Towards mathematics of states and observation
cites work: Trace semantics via determinization
cites work: Coalgebraic trace semantics for continuous probabilistic transition systems
cites work: Probability theory. A comprehensive course.
cites work: Universal coalgebra: A theory of systems
cites work: Generalizing determinization from automata to coalgebras
cites work: Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems
cites work: Probabilistic systems coalgebraically: a survey
cites work: Coalgebraic Infinite Traces and Kleisli Simulations
description: scientific article; zbMATH DE number 6962934