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 …

The work in this thesis has been carried out at the Centrum Wiskunde & Informatica, under
the auspices of the research school IPA (Institute for Programming research and …

Stream circuits are a convenient graphical way to represent streams (or stream functions)
computed by finite dimensional linear systems. We present a sound and complete …

A modal logic that is strong enough to fully characterize the behavior of a system is called
expressive. Recently, with the growing diversity of systems to be reasoned about …

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 …

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

The last decade has seen a surge of interest in nominal sets and their applications to formal
methods for programming languages. This thesis studies two subjects: algebra and duality …

Coalgebras for a functor model different types of transition systems in a uniform way. This
paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular …

The Goldblatt-Thomason Theorem for Coalgebras Page 1 The Goldblatt-Thomason Theorem
for Coalgebras Alexander Kurz1,⋆ and Jirı Rosický2,⋆⋆ 1 University of Leicester, UK 2 Masaryk …

Several dynamical systems, such as deterministic automata and labelled transition systems,
can be described as coalgebras of so-called Kripke polynomial functors, built up from …