2024-06-26
Radboud University
The next meeting of 2024 will be held at the Radboud University Nijmegen (Huygens building, room HG00.308) on 26th June.
From Nijmegen Station, the Huygens building can be reached using bus 10, getting off at bus stop Huygensgebouw, or by taking a train in the direction of Venlo/Venray/Roermond and getting off at Nijmegen Heyendaal (1 stop).
Everyone is welcome to join us, there is no need to register!
Schedule
13:00 | Room open | |||
13:30 - 14:15 | Samuel Humeau Title: A finite presentation of graphs of treewidth at most 3 (Amina Doumane, Samuel Humeau, Damien Pous, (ENS de Lyon)) Abstract
We provide a finite equational presentation of graphs of treewidth at most three, solving an instance of an open problem by Courcelle and Engelfriet.
|
|||
14:15 - 14:30 | Coffee break | |||
14:30 - 15:15 | Jan Martens Title: Computing minimal distinguishing behaviour Abstract
We are motivated by explaining the behavioural inequivalence of two states in a finite transition system. Since good explanations are usually concise, our goal is to compute minimal distinguishing behaviour. We use the Hennessy-Milner logic (HML) to express behavioural properties. An HML formula that is satisfied in exactly one of the states is called a distinguishing formula, since it contains behaviour exhibited by one state but not the other. Our goal is to compute a minimal distinguishing formula.
|
|||
15:15 - 15:30 | Coffee break | |||
15:30 - 16:15 | Chase Ford Title: Graded equational reasoning AbstractAmong the most celebrated results in category theory is the Lawvere-Linton correspondence theorem relating equational theories in the sense of universal algebra, the algebraic theories of Lawvere, and finitary monads on the category of sets. In this talk, we discuss an extension of the monad-theory part of this correspondence to the setting of graded monads, a generalization of monads given by a stratification of the monad structure in a monoidal category. In detail, we will describe a notion of graded equational theory along with a graded variant of Birkhoff's equational logic. This will allow the formulation of a syntactic characterization of finitary graded monads on sets. Time permitting, I will indicate some details on how graded equational theories can be adapted to the setting of locally presentable categories (e.g. posets, metric spaces, nominal sets, etc.). |