13:15-14:15, Friday 27 April, EM 1.83.
Title: Coalgebraic Modal Logic & Learning
Coalgebra provides a general model of state-based transition systems. Coalgebraic Modal Logic allows to specify properties of such systems. In my talk I plan to (i) provide a brief introduction to coalgebraic modal logic and (ii) describe how these logics can be used to generalise Angluin’s L* algorithm for automata learning to the coalgebraic level. The result is a new algorithm that allows to learn bisimulation quotients of a large variety of transition systems.
(Joint work with Simone Barlocco.)