Iterated Covariant Powerset is not a Monad1 Page 1 Iterated Covariant Powerset is not a
Monad1 Bartek Klin2 Faculty of Mathematics, Informatics, and Mechanics University of Warsaw …

The framework of graded semantics uses graded monads to capture behavioural
equivalences of varying granularity, for example as found in the linear-time/branching-time …

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 …

State-based models of concurrent systems are traditionally considered under a variety of
notions of process equivalence. In the particular case of labelled transition systems, these …

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 …

We develop a modular method to build algebraic structures. Our approach is categorical: we
describe the layers of our construct as monads, and combine them using distributive laws …

We introduce Probabilistic Regular Expressions (PRE), a probabilistic analogue of regular
expressions denoting probabilistic languages in which every word is assigned a probability …

Coalgebra, as the abstract study of state-based systems, comes naturally equipped with a
notion of behavioural equivalence that identifies states exhibiting the same behaviour. In …

Like notions of process equivalence, behavioural preorders on processes come in many
flavours, ranging from fine-grained comparisons such as ready simulation to coarse-grained …

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