Coalgebraic Behavioral Metrics

12/20/2017
by   Paolo Baldan, et al.
0

We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. Given a coalgebra α X → HX for a functor H Set→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 Set to a functor H on the category 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 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/27/2018

Trace and Testing Metrics on Nondeterministic Probabilistic Processes

The combination of nondeterminism and probability in concurrent systems ...
research
10/03/2011

A Behavioral Distance for Fuzzy-Transition Systems

In contrast to the existing approaches to bisimulation for fuzzy systems...
research
02/22/2021

Behavioral QLTL

In this paper we introduce Behavioral QLTL, which is a “behavioral” vari...
research
03/23/2021

Depth-based pseudo-metrics between probability distributions

Data depth is a non parametric statistical tool that measures centrality...
research
09/30/2021

Deciding All Behavioral Equivalences at Once: A Game for Linear-time–Branching-time Spectroscopy

We introduce a generalization of the bisimulation game that can be emplo...
research
05/28/2023

Linear-Time–Branching-Time Spectroscopy Accounting for Silent Steps

We provide the first generalized game characterization of van Glabbeek's...
research
08/04/2023

Comments on "A Linear Time Algorithm for the Optimal Discrete IRS Beamforming"

Comments on [1] are provided. Updated necessary and sufficient condition...

Please sign up or login with your details

Forgot password? Click here to reset