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 revisit coinductive proof principles from a lattice theoretic point of view. By associating to
any monotone function a function which we call the companion, we give a new presentation …

The Method of Coalgebra: exercises in coinduction Jan Rutten Page 1 The Method of
Coalgebra: exercises in coinduction Jan Rutten February 2019 261 pages ISBN 978-90-6196-568-8 …

The endless transformation of technological innovation requires greater collaboration of
Information Communication and Technology (ICT) in various areas especially in public …

This paper is concerned with knowledge graph embedding with background knowledge,
taking the formal perspective of logics. In knowledge graph embedding, knowledge …

Robin Milner (1984) gave a sound proof system for bisimilarity of regular expressions
interpreted as processes: Basic Process Algebra with unary Kleene star iteration, deadlock …

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 …

We investigate causal computations, which take sequences of inputs to sequences of
outputs such that the nth output depends on the first n inputs only. We model these in …

Weighted automata are a generalisation of non-deterministic automata where each
transition, in addition to an input letter, has also a quantity expressing the weight (eg cost or …