Approximating and computing behavioural distances in probabilistic transition systems

DOI10.1016/J.TCS.2006.05.021zbMATH Open1097.68102OpenAlexW2076087052MaRDI QIDQ2503333FDOQ2503333

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1864592
• A behavioural pseudometric for probabilistic transition systems
• On metrics for probabilistic systems: definitions and algorithms
• Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
• Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems

zbMATH Keywords

linear programmingapproximationcoalgebrabehavioural pseudometricprobabilistic transition system

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (26)

• Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
• Quantitative Kleene coalgebras
• Approximating bisimilarity for Markov processes
• Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
• Approximating Markov processes through filtration
• Title not available (Why is that?)
• On metrics for probabilistic systems: definitions and algorithms
• CONCUR 2005 – Concurrency Theory
• Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
• Simulation distances
• Quantitative abstractions for collective adaptive systems
• Title not available (Why is that?)
• Unwinding biological systems
• Complete axiomatization for the total variation distance of Markov chains
• Comparing chemical reaction networks: a categorical and algorithmic perspective
• (Metric) bisimulation games and real-valued modal logics for coalgebras
• Polynomial-time algorithms for computing distances of fuzzy transition systems
• Quantitative simulation games
• On the metric-based approximate minimization of Markov chains
• Quantitative relations and approximate process equivalences.
• A pseudometric in supervisory control of probabilistic discrete event systems
• Title not available (Why is that?)
• Computing bisimilarity metrics for probabilistic timed automata
• Quantitative Behavioural Reasoning for Higher-order Effectful Programs
• Title not available (Why is that?)
• A behavioural pseudometric for probabilistic transition systems

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

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