Coalgebras can be seen as a natural abstraction of Kripke frames. In the same sense,
coalgebraic logics are generalised modal logics. In this paper, we give an overview of the …

Publisher Summary This chapter outlines the development of the algebraic semantics of
modal logic and introduces an alternative coalgebraic approach. Algebraic semantics is …

Trace semantics has been defined for various kinds of state-based systems, notably with
different forms of branching such as non-determinism vs. probability. In this paper we claim …

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 …

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

We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-
order logic by strictly positive inductive and coinductive definitions. We define a realizability …

Abstract Automata learning is a popular technique for inferring minimal automata through
membership and equivalence queries. In this paper, we generalise learning to the theory of …

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 …

In recent years, a tight connection has emerged between modal logic on the one hand and
coalgebras, understood as generic transition systems, on the other hand. Here, we prove …

This article investigates expressivity of modal logics for transition systems, multitransition
systems, Markov chains and Markov processes, as coalgebras of the powerset, finitely …