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 …

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 …

Applications of modal logics are abundant in computer science, and a large number of
structurally different modal logics have been successfully employed in a diverse spectrum of …

We present an overview of linear-time temporal logics with Presburger constraints whose
models are sequences of tuples of integers. Such formal specification languages are well …

The coalgebraic approach to modal logic provides a uniform framework that captures the
semantics of a large class of structurally different modal logics, including eg graded and …

Abstract Models of concurrent systems employ a wide variety of semantics inducing various
notions of process equivalence, ranging from linear-time semantics such as trace …

There is a wide range of modal logics whose semantics goes beyond relational structures,
and instead involves, eg, probabilities, multi-player games, weights, or neighbourhood …

This paper explores a new language of neighbourhood structures where existential
information can be given about what kind of worlds occur in a neighbourhood of a current …

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 …

Simulations serve as a proof tool to compare the behaviour of reactive systems. We define a
notion of Λ-simulation for coalgebraic modal logics, parametric in the choice of a set Λ of …