Calvin Lab Auditorium
The area of automata learning was pioneered by Angluin in the 70's. Her original algorithm, which applied to regular languages and deterministic automata, has been extended to various types of automata and used in software and hardware verification. In this talk, we will take an abstract perspective at automata learning. We show how the correctness of the original algorithm and many extensions can be captured in one proof using coalgebraic techniques. We also show that a novel algorithm for nominal automata (which are automata over infinite alphabets) can be derived from the abstract framework. The new algorithm has applications to verification of cryptographic protocols.