In contrast to its wealth of applications in mathematics, the Kantorovich metric started to be
noticed in computer science only in recent years. We give a brief survey of its applications in …

We develop a model of parametric probabilistic transition Systems (PPTSs), where
probabilities associated with transitions may be parameters. We show how to find instances …

In contrast with the existing approaches to exact bisimulation for fuzzy systems, we introduce
a robust notion of behavioral distance to measure the behavioral similarity of …

In an earlier paper we presented a pseudometric on the states of a probabilistic transition
system, yielding a quantitative notion of behavioural equivalence. The behavioural …

The monad of convex sets of probability distributions is a well-known tool for modelling the
combination of nondeterministic and probabilistic computational effects. In this work we lift …

Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural
pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative …

We study behavioral metrics in an abstract coalgebraic setting. Given a coalgebra alpha: X->
FX in Set, where the functor F specifies the branching type, we define a framework for …

Quantum cryptographic systems have been commercially available, with a striking
advantage over classical systems that their security and ability to detect the presence of …

Abstract Cyber-Physical Systems (CPSs) are integrations of networking and distributed
computing systems with physical processes, where feedback loops allow physical …

Behavioural distances provide a fine-grained measure of equivalence in systems involving
quantitative data, such as probabilistic, fuzzy, or metric systems. Like in the classical setting …