2017-10-13: Simone Barlocco (MSP)

Sat, 21 Oct 2023 21:24:08 +0100

Simone Barlocco (MSP)

Coalgebraic Learning

Abstract

Automata learning is a well known technique to infer a finite state machine from a set of observations. One important algorithm for automata learning is the L* algorithm by Dana Angluin. In this 101 I will present a new perspective on L* using ideas from coalgebra and modal logic. After a brief recap of how L* works, I will describe a generalisation of the L* algorithm to the coalgebraic level. I will conclude my talk with two concrete instances of the general framework: the learning of Mealy machines and of bisimulation quotients of probabilistic transition systems. Joint work with Clemens Kupke.

2017-10-13 16:00:00 UTC
LT1310