Back to Search Start Over

Coalgebraic Behavioral Metrics

Authors :
Paolo Baldan
Filippo Bonchi
Henning Kerstan
Barbara König
Source :
Logical Methods in Computer Science, Vol Volume 14, Issue 3 (2018)
Publication Year :
2018
Publisher :
Logical Methods in Computer Science e.V., 2018.

Abstract

We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. Given a coalgebra $\alpha\colon X \to HX$ for a functor $H \colon \mathrm{Set}\to \mathrm{Set}$, we define a framework for deriving pseudometrics on $X$ which measure the behavioral distance of states. A crucial step is the lifting of the functor $H$ on $\mathrm{Set}$ to a functor $\overline{H}$ on the category $\mathrm{PMet}$ of pseudometric spaces. We present two different approaches which can be viewed as generalizations of the Kantorovich and Wasserstein pseudometrics for probability measures. We show that the pseudometrics provided by the two approaches coincide on several natural examples, but in general they differ. If $H$ has a final coalgebra, every lifting $\overline{H}$ yields in a canonical way a behavioral distance which is usually branching-time, i.e., it generalizes bisimilarity. In order to model linear-time metrics (generalizing trace equivalences), we show sufficient conditions for lifting distributive laws and monads. These results enable us to employ the generalized powerset construction.

Details

Language :
English
ISSN :
18605974
Volume :
ume 14, Issue 3
Database :
Directory of Open Access Journals
Journal :
Logical Methods in Computer Science
Publication Type :
Academic Journal
Accession number :
edsdoj.b004f4f66ab400db24a48e1bd3e726d
Document Type :
article
Full Text :
https://doi.org/10.23638/LMCS-14(3:20)2018