Recursively defined metric spaces without contraction

DOI10.1016/j.tcs.2007.02.059zbMath1118.68085OpenAlexW2108489993MaRDI QIDQ2373743

James Worrell, Claudio Hermida, Franck Van Breugel, Michael Makkai

Publication date: 16 July 2007

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

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

zbMATH Keywords

metric spaceaccessible categoryKantorovich metricbehavioural pseudometricaccessible functorprobabilistic transition system

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

A note on distances between probabilistic and quantum distributions, On Finitary Functors, A pseudometric in supervisory control of probabilistic discrete event systems, Addendum to ``Recursively defined metric spaces without contraction, Explainability of probabilistic bisimilarity distances for labelled Markov chains, Approximating Markov processes through filtration, The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata, Bisimulation for Markov Decision Processes through Families of Functional Expressions, Approximation in quantale-enriched categories, Unnamed Item, Unnamed Item, Unnamed Item, Final coalgebras in accessible categories, On finitary functors and their presentations

Cites Work

• Metrics for labelled Markov processes
• Elements of generalized ultrametric domain theory
• Solving reflexive domain equations in a category of complete metric spaces
• Denotational semantics of a parallel object-oriented language
• On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
• The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
• Towards a foundation for semantics in complete metric spaces
• Bisimulation through probabilistic testing
• Structural induction and coinduction in a fibrational setting
• Liminf convergence in \(\Omega\)-categories
• CONCUR 2003 -- concurrency theory. 14th international conference, Marseille, France, September 3--5, 2003. Proceedings
• Universal coalgebra: A theory of systems
• A behavioural pseudometric for probabilistic transition systems
• De Bakker-Zucker processes revisited
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Terminal coalgebras in well-founded set theory
• Bisimulation for labelled Markov processes
• Sur une méthode de métrisation complète de certains espaces d'ensembles compacts
• Accessible Categories: The Foundations of Categorical Model Theory
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
• Processes and the denotational semantics of concurrency
• Extension of range of functions
• Automata, Languages and Programming
• Subequalizers
• CONCUR 2005 – Concurrency Theory
• On the structure of categories of coalgebras
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item