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 …

Modal logic has a good claim to being the logic of choice for describing the reactive
behaviour of systems modelled as coalgebras. Logics with modal operators obtained from …

Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It
is shown that under certain assumptions, accessible functors admit expressive logics for …

Bisimilarity as an equivalence notion of systems has been central to process theory. Due to
the recent rise of interest in quantitative systems (probabilistic, weighted, hybrid, etc.) …

The classical Hennessy-Milner theorem says that two states of an image-finite transition
system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In …

We introduce a general and compositional, yet simple, framework that allows us to derive
soundness and expressiveness results for modal logics characterizing behavioural …

Compositional methods are central to the verification of software systems. For concurrent
and communicating systems, compositional techniques based on behavioural type systems …

We provide a generic algorithm for constructing formulae that distinguish behaviourally
inequivalent states in systems of various transition types such as nondeterministic …

From the point of view of modal logic, coalgebraic logic over posets is the natural
coalgebraic generalisation of positive modal logic. From the point of view of coalgebra …

Transition systems pervade much of computer science. This article outlines the beginnings
of a general theory of specification languages for transition systems. More specifically …