2018-11-30: Simone Barlocco (MSP)

Tue, 14 Oct 2025 16:51:42 +0000

Simone Barlocco (MSP)

Dual adjunctions

Abstract

Coalgebras provide an abstract framework to represent state-based transition systems. Modal logics provide a formal language to specify such systems. In our recently submitted work (joint work with Clemens Kupke and Jurriaan Rot) we devise a general algorithm to learn coalgebras. Modal formulas are used as tests to probe the behaviour of states.

In my introductory talk, I will discuss how to set up a general framework that connects coalgebras and their modal logics via a dual adjunction. Moreover, I will show a known result which guarantees that indistinguishable states wrt to modal formulas are behavioural equivalent, a key fact that entails that — whenever possible — our algorithm learns a minimal representation of a coalgebra.

2018-11-30 16:15:00 UTC
LT1310