We present an Angluin-style algorithm to learn nominal automata, which are acceptors of
languages over infinite (structured) alphabets. The abstract approach we take allows us to …

Guarded Kleene Algebra with Tests (GKAT) provides a sound and complete framework to
reason about trace equivalence between simple imperative programs. However, there are …

We propose a generic categorical framework for learning unknown formal languages of
various types (eg finite or infinite words, weighted and nominal languages). Our approach is …

Nominal sets are a convenient setting for languages over infinite alphabets, ie data
languages. We introduce an automaton model over nominal sets, regular nondeterministic …

Automata learning plays a more and more prominent role in the field of software verification.
Learning algorithms are able to automatically explore the behaviour of software. By …

Programming languages abound with features making use of names in various ways. There
is a mathematical foundation for the semantics of such features which uses groups of …

Coalgebraic bisimilarity minimization generalizes classical automaton minimization to a
large class of automata whose transition structure is specified by a functor, subsuming …

Nominal sets provide a framework to study key notions of syntax and semantics such as
fresh names, variable binding and α-equivalence on a conveniently abstract categorical …

We study at an abstract level imperative while programs with an explicit fail operation that
causes abnormal termination or irreparable failure, and a try-catch operation for error …

There are different categorical approaches to variations of transition systems and their
bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span of …