The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …

Markov decision processes (MDPs) offer a popular mathematical tool for planning and
learning in the presence of uncertainty (Boutilier, Dean, & Hanks 1999). MDPs are a …

The notion of process equivalence of probabilistic processes is sensitive to the exact
probabilities of transitions. Thus, a slight change in the transition probabilities will result in …

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 …

Formal methods are increasingly being used for control and verification of dynamic systems
against complex specifications. In general, these methods rely on a relatively simple system …

In recent years, various metrics have been developed for measuring the behavioral similarity
of states in probabilistic transition systems [J. Desharnais et al., Proceedings of …

We develop a quantitative analogue of equational reasoning which we call quantitative
algebra. We define an equality relation indexed by rationals: a= ε b which we think of as …

Discrete notions of behavioural equivalence sit uneasily with semantic models featuring
quantitative data, like probabilistic transition systems. In this paper, we present a …

This paper develops a notion of approximation for a class of stochastic hybrid systems that
includes, as special cases, both jump linear stochastic systems and linear stochastic hybrid …

We observe that equivalence is not a robust concept in the presence of numerical
information-such as probabilities-in the model. We develop a metric analogue of weak …