(In)finite trace equivalence of probabilistic transition systems

DOI10.1007/978-3-030-00389-0_7MaRDI QIDQ1798789zbMATH OpenOpenAlexFDO

Authors Alexandre Goy, Jurriaan Rot

Publication date 23 October 2018

Full work available at URL http://hdl.handle.net/2066/197615

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 149518
• CONCUR 2004 - Concurrency Theory
• Deciding probabilistic bisimilarity over infinite-state probabilistic systems
• On the relationship between bisimulation and trace equivalence in an approximate probabilistic context
• Sound and complete axiomatization of trace semantics for probabilistic systems

Cites work

• scientific article; zbMATH DE number 3764843 (Why is no real title available?)
• scientific article; zbMATH DE number 7204940 (Why is no real title available?)
• A general account of coinduction up-to
• Checking NFA equivalence with bisimulations up to congruence
• Coalgebraic Infinite Traces and Kleisli Simulations
• Coalgebraic trace semantics for continuous probabilistic transition systems
• From branching to linear time, coalgebraically
• Generalizing determinization from automata to coalgebras
• Generic Trace Semantics via Coinduction
• Infinite dimensional analysis. A hitchhiker's guide.
• Introduction to coalgebra. Towards mathematics of states and observation
• Probabilistic systems coalgebraically: a survey
• Probability theory. A comprehensive course.
• Sound and complete axiomatization of trace semantics for probabilistic systems
• Trace semantics via determinization
• Universal coalgebra: A theory of systems
• Up-To Techniques for Weighted Systems
• Weighted Bisimulation in Linear Algebraic Form

Cited in

(9)

• Relational and Kleene-Algebraic Methods in Computer Science
• Alternative characterizations of probabilistic trace equivalences on coherent resolutions of nondeterminism
• Sound and complete axiomatization of trace semantics for probabilistic systems
• Tracing relations probabilistically
• On the relationship between bisimulation and trace equivalence in an approximate probabilistic context
• Equivalences for silent transitions in probabilistic systems (extended abstract)
• A Complete Axiomatisation for Probabilistic Trace Equivalence
• Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory
• scientific article; zbMATH DE number 149518 (Why is no real title available?)

This page was built for publication: (In)finite trace equivalence of probabilistic transition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1798789)