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 …

There is a large amount of literature on the topic of covarieties, coequations and
coequational specifications, dating back to the early seventies. Nevertheless, coequations …

The powerset construction is a standard method for converting a nondeterministic
automaton into a deterministic one recognizing the same language. In this paper, we lift the …

Coalgebra is an abstract framework for the uniform study of different kinds of dynamical
systems. An endofunctor $ F $ determines both the type of systems ($ F $-coalgebras) and a …

Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient
proof techniques for checking properties of different kinds of systems. We prove the …

We survey the work on both discrete and continuous-space probabilistic systems as
coalgebras, starting with how probabilistic systems are modeled as coalgebras and followed …

We survey work in category theory and coalgebra on how to extend a functor from maps to
relations. This relation lifting has a universal property, which is presented in some detail and …

Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient
proof techniques for checking properties of different kinds of systems. We prove the …

Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are
therefore a powerful semantic foundation for modeling concurrent systems with random …

The classical Hennessy-Milner theorem is an important tool in the analysis of concurrent
processes; it guarantees that any two non-bisimilar states in finitely branching labelled …