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 …

In Petri nets with data, every token carries a data value, and executability of a transition is
conditioned by a relation between data values involved. Decidability status of various …

Register automata are one of the simplest classes of automata that operate on infinite input
alphabets. Each automaton comes equipped with a finite set of registers where it can store …

First-order logic, and quantifiers in particular, are widely used in deductive verification of
programs and systems. Quantifiers are essential for describing systems with unbounded …

We investigate several variants of the homomorphism problem: given two relational
structures, is there a homomorphism from one to the other? The input structures are possibly …

We present an implemented programming language called LOIS, which allows iterating
through certain infinite sets, in finite time. We argue that this language offers a new …

We study an extension of modal µ-calculus to sets with atoms and we study its basic
properties. Model checking is decidable on orbit-finite structures, and a correspondence to …

We are motivated by the following question: which nominal languages admit an active
learning algorithm? This question was left open in previous work, and is particularly …

We introduce an extension of modal mu-calculus to sets with atoms and study its basic
properties. Model checking is decidable on orbit-finite structures, and a correspondence to …

Register automata are one of the simplest classes of automata that operate on infinite
alphabets. Each automaton comes equipped with a finite set of registers where it can store …