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 …

We introduce bisimulation up to congruence as a technique for proving language
equivalence of non-deterministic finite automata. Exploiting this technique, we devise an …

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 …

Combining probabilistic choice and non-determinism is a long standing problem in
denotational semantics. From a category theory perspective, the problem stems from the …

We address the task of deriving fixpoint equations from modal logics characterizing
behavioural equivalences and metrics (summarized under the term conformances). We rely …

Computer-aided cryptography increases the rigour of cryptographic proofs by mechanizing
their verification. Existing tools focus mainly on game-based proofs, and efforts to formalize …

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 …

This paper takes a fresh look at the topic of trace semantics in the theory of coalgebras. In
the last few years, two approaches, somewhat incomparable at first sight, captured …

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 (PA) combine probability and nondeterminism. They can be given
different semantics, like strong bisimilarity, convex bisimilarity, or (more recently) distribution …