Approximating and computing behavioural distances in probabilistic transition systems

DOI10.1016/J.TCS.2006.05.021MaRDI QIDQ2503333zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 4179422 (Why is no real title available?)
• scientific article; zbMATH DE number 3134565 (Why is no real title available?)
• scientific article; zbMATH DE number 3964277 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3764843 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 1361128 (Why is no real title available?)
• scientific article; zbMATH DE number 1064116 (Why is no real title available?)
• scientific article; zbMATH DE number 1113628 (Why is no real title available?)
• scientific article; zbMATH DE number 2038772 (Why is no real title available?)
• scientific article; zbMATH DE number 1754609 (Why is no real title available?)
• scientific article; zbMATH DE number 1864592 (Why is no real title available?)
• scientific article; zbMATH DE number 3429908 (Why is no real title available?)
• scientific article; zbMATH DE number 3245885 (Why is no real title available?)
• A behavioural pseudometric for probabilistic transition systems
• A calculus of communicating systems
• A strongly polynomial minimum cost circulation algorithm
• Algebraic laws for nondeterminism and concurrency
• Approximate reasoning for real-time probabilistic processes
• Automata, Languages and Programming
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Bisimulation through probabilistic testing
• Extension of range of functions
• Metrics for labelled Markov processes
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
• Solving reflexive domain equations in a category of complete metric spaces
• Subequalizers
• Universal coalgebra: A theory of systems

Cited in

(26)

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

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)