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 introduce Probabilistic Guarded Kleene Algebra with Tests (ProbGKAT), an extension of
GKAT that allows reasoning about uninterpreted imperative programs with probabilistic …

Guarded Kleene Algebra with Tests (GKAT) is a fragment of Kleene Algebra with Tests
(KAT) that was recently introduced to reason efficiently about imperative programs. In …

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

Kleene Algebra with Tests (KAT) provides an elegant algebraic framework for describing
non-deterministic finite-state computations. Using a small finite set of non-deterministic …

An open problem posed by Milner asks for a proof that a certain axiomatisation, which Milner
showed is sound with respect to bisimilarity for regular expressions, is also complete. One of …

We develop a (co) algebraic framework to study a family of process calculi with monadic
branching structures and recursion operators. Our framework features a uniform semantics …

Model-based testing has been highlighted in the last few decades. Many improvements
have been proposed for this testing method. One improvement is the use of extended …

Kleene Algebra (KA) is the algebra of regular expressions. Central to the study of KA is
Kozen's (1994) completeness result, which says that any equivalence valid in the language …

Guarded Kleene Algebra with Tests (GKAT) is the fragment of Kleene Algebra with Tests
(KAT) that arises by replacing the union and iteration operations of KAT with predicate …