On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
Information Processing Letters
Denotational semantics of a parallel object-oriented language
Information and Computation
Towards a foundation for semantics in complete metric spaces
Information and Computation
Bisimulation through probabilistic testing
Information and Computation
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Handbook of logic in computer science (vol. 1)
Elements of generalized ultrametric domain theory
Theoretical Computer Science
Liminf convergence in &OHgr;-categories
Theoretical Computer Science
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
From Banach to Milner: metric semantics for second order communication and concurrency
Proof, language, and interaction
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
On the structure of categories of coalgebras
Theoretical Computer Science
Ten Years of Concurrency Semantics; Selected Papers of the Amsterdam Concurrency Group
Ten Years of Concurrency Semantics; Selected Papers of the Amsterdam Concurrency Group
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The Metric Closure Powerspace Construction
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Testing Labelled Markov Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Effective Solutions to Domain Equations - An Approach to Effective Denotational Semantics
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Mathematical Structures in Computer Science
De Bakker-Zucker processes revisited
Information and Computation
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
The Kantorovich Metric in Computer Science: A Brief Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
On the complexity of computing probabilistic bisimilarity
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Approximating Markov processes through filtration
Theoretical Computer Science
A pseudometric in supervisory control of probabilistic discrete event systems
Discrete Event Dynamic Systems
Hi-index | 5.23 |
In this paper we use the theory of accessible categories to find fixed points of endofunctors on the category of 1-bounded complete metric spaces and nonexpansive functions. In contrast to previous approaches, we do not assume that the endofunctors are locally contractive, and our results do not depend on Banach's fixed-point theorem. Our approach is particularly suitable for constructing models of systems that feature quantitative data. For instance, using the Kantorovich metric on probability measures we construct a quantitative model for probabilistic transition systems. The metric in our model can reasonably be seen as measuring the behavioural distance between states of the system; it depends exclusively on the transition probabilities and not on an arbitrary discount factor.