Research
On this page, you can find preprints, published papers, other writings, talks, and my theses. Please also have a look at DBLP, Google Scholar, and ORCID.
Preprints
 arXiv Residuality and Learning for Nondeterministic Register Automata — [ More ]
 arXiv (to appear at LICS'21) OrbitFiniteDimensional Vector Spaces and Weighted Register Automata — [ More ]
 arXiv Fast Computations on Ordered Nominal Sets (extended version) — [ More ]
Published
 Conference Paper LOPSTR 2020 Generating Functions for Probabilistic Programs — [ More ]
 Conference Paper CONCUR 2020 Residual Nominal Automata — [ More ]
 Conference Paper CSL 2020 Separation and Renaming in Nominal Sets — [ More ]
 Journal Paper JLAMP A (co)algebraic theory of succinct automata — [ More ]
 Journal Paper SQJ nComplete test suites for IOCO (extended version) — [ More ]
 Conference Paper ICTAC 2018 Fast Computations on Ordered Nominal Sets — [ More ]
 Conference Paper ICGI 2018 Learning Product Automata — [ More ]
 Conference Paper ICTSS 2017 nComplete Test Suites for IOCO — [ More ]
 Conference Paper POPL 2017 Learning Nominal Automata — [ More ]
 Conference Paper LATA 2016 Minimal Separating Sequences for All Pairs of States — [ More ]
 Conference Paper ICFEM 2015 Applying Automata Learning in Embedded Control Software — [ More ]
Others
 Report RERS RERS 2020 — Learning, Testing, Fuzzing and Slicing — [ More ]
 Extended Abstract Highlights 2020 Residuality and Learning for Register Automata — [ More ]
 Poster LearnAut 2017 Learning Product Automata — [ More ]
 Report arXiv Complementing Model Learning with MutationBased Fuzzing — [ More ]
Talks
 2021 April, OWLS. Weighted Register Automata
 2021 March, Seminar at the RHUL. Weighted Register Automata
 2021 March, UnRAVel Seminar. Weighted Register Automata
 2020 December, FSTTCS. Tutorial on Automata Learning [ Youtube ]
 2020 September, Highlights. Residuality and Learning for Register Automata
 2020 September, CONCUR. Residual Nominal Automata [ Youtube ]
 2020 July, Radboud S^3. Residuality and Learning for Nondeterministic Register Automata
 2020 March, DCON. Query Learning of Register Automata
 2019 December, MOVES Seminar. Learning Probabilistic Automata (overview talk)
 2019 June, MFPS. Separation and Renaming in Nominal Sets (contributed talk)
 2018 November, IPA Dall Days. Learning Register Automata
 2018 June, Dutch Model Checking Day. Minimal Separating Sequences for All Pairs of States in O(m log n)
 2017 December, UnRAVel Seminar. Ordered Nominal Sets and Automata
 2017 January, Radboud S^3. Learning Nominal Automata
 2016 November, #RU College. Leren om te verifiëren [ Youtube ]
 2016 November, IPA Fall Days. Learning to verify
 2016 May, Brouwer Seminar. Succinct Nominal automata?
 2016 April, UCL PPLV Yak. Automata over the random graph
 2015 November, ICFEM. Applying Automata Learning in Embedded Control Software
 2015 October, NL Testing day. Applying Automata Learning to Embedded Control Software
 2015 June, Radboud MBSD seminar. The zoo of FSMbased test methods
If you would like to have slides from any of my talks, feel free to send me a message.
Notes
I sometimes write some notes for friends and colleagues. These are typically hard to read without context, will not include the necessary references and will include errors. But maybe they are still useful for some people…

PP is not a monad?! [ PDF ] Update: This is settled once and for all by Bartek Klin and Julian Salamanca, they show that there is no monad structure at all on the functor PP (where P is covariant). Meven Bertrand showed a good way of achieving a double powerset by considering upsets of downsets in a poset. This is a nice way to model alternating automata, for example.

See also my Research Blog.
Theses

My PhD Thesis has a dedicated page. I was supervised by Frits Vaandrager, Bas Terwijn, and Alexandra Silva.

My master thesis was on Rational Homotopy Theory, supervised by Ieke Moerdijk. Rational homotopy theory is concerned with algebraic invariants of topological spaces. Invariants such as homotopy groups are notoriously hard to compute, but very useful in mathematics. To simplify things, we can rationalise them (that is, using rational numbers instead of integers). This way, the invariants are easier to compute. [ PDF ] [ Github ]

My bachelor thesis was on the DoldKan Correspondence, supervised by Moritz Groth. The DoldKan correspondence is an equivalence between categories: on one hand there is the topological category of simplicial abelian groups and on the other hand there is the more algebraic category of chain complexes. This is a key result in algebraic topology, especially homology. [ PDF ] [ Presentation ] [ Github ]