Approximating and computing behavioural distances in probabilistic transition systems

DOI10.1016/J.TCS.2006.05.021zbMath1097.68102OpenAlexW2076087052MaRDI QIDQ2503333

James Worrell, Franck Van Breugel

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.021

zbMATH Keywords

linear programmingcoalgebraapproximationbehavioural pseudometricprobabilistic transition system

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (14)

Approximating bisimilarity for Markov processes ⋮ Complete axiomatization for the total variation distance of Markov chains ⋮ A pseudometric in supervisory control of probabilistic discrete event systems ⋮ Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ Approximating Markov processes through filtration ⋮ (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras ⋮ Quantitative Kleene coalgebras ⋮ Quantitative Simulation Games ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Unnamed Item ⋮ On the metric-based approximate minimization of Markov chains ⋮ Quantitative Abstractions for Collective Adaptive Systems ⋮ Simulation distances ⋮ Unwinding biological systems

Cites Work

• Metrics for labelled Markov processes
• Solving reflexive domain equations in a category of complete metric spaces
• A strongly polynomial minimum cost circulation algorithm
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• Universal coalgebra: A theory of systems
• A behavioural pseudometric for probabilistic transition systems
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Algebraic laws for nondeterminism and concurrency
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
• Extension of range of functions
• Approximate reasoning for real-time probabilistic processes
• Subequalizers
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating and computing behavioural distances in probabilistic transition systems