An Accessible Approach to Behavioural Pseudometrics With an Application to Probabilistic Systems

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 the...

Full description

Saved in:
Bibliographic Details
Published inAutomata, Languages and Programming pp. 1018 - 1030
Main Authors van Breugel, Franck, Hermida, Claudio, Makkai, Michael, Worrell, James
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Accessible Category
Applied sciences
Automata. Abstract machines. Turing machines
Complete Lattice
Computer science; control theory; systems
Concurrent System
Distance Function
Exact sciences and technology
Nonexpansive Function
Theoretical computing
Probabilistic approach
Automaton
Behavioral analysis
Concurrency
Category theory
Distributed system
Modeling
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:3540275800
9783540275800
ISSN:0302-9743
1611-3349
DOI:10.1007/11523468_82