An accessible approach to behavioural pseudometrics

Authors:
Franck van Breugel;Claudio Hermida;Michael Makkai;James Worrell
Affiliations:
Department of Computer Science, York University, Toronto, Ontario, Canada;Department of Mathematics, Instituto Superior Técnico, Lisbon, Portugal;Department of Mathematics and Statistics, McGill University, Montreal, Quebec, Canada;Department of Mathematics, Tulane University, New Orleans, LA
Venue:
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Year:
2005

Citing 13
Cited 6

Bisimulation through probabilistic testing

Information and Computation
Terminal coalgebras in well-founded set theory

Theoretical Computer Science
Control flow semantics

Control flow semantics
Bisimulation for probabilistic transition systems: a coalgebraic approach

Theoretical Computer Science
The Metric Analogue of Weak Bisimulation for Probabilistic Processes

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Towards Quantitative Verification of Probabilistic Transition Systems

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Metrics for Labeled Markov Systems

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Probabilistic Domains

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

Mathematical Structures in Computer Science
Approximate Reasoning for Real-Time Probabilistic Processes

QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
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
Discounting the future in systems theory

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

A behavioural pseudometric for metric labelled transition systems

CONCUR 2005 - Concurrency Theory
Approximating and computing behavioural distances in probabilistic transition systems

Theoretical Computer Science
The Kantorovich Metric in Computer Science: A Brief Survey

Electronic Notes in Theoretical Computer Science (ENTCS)
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A categorical view of timed weak bisimulation

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A pseudometric in supervisory control of probabilistic discrete event systems

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Behavioural pseudometrics are a quantitative analogue of behavioural equivalences. They provide robust models for those concurrent systems in which quantitative data plays a crucial role. In this paper, we show how behavioural pseudometrics can be defined coalgebraically. Our results rely on the theory of accessible categories. We apply our results to obtain a robust model for probabilistic systems.