(2020) Residuality and Learning for Register Automata - Joshua Moerman. Highlights 2020. [ Abstract ]
(2020) Residual Nominal Automata - Joshua Moerman and Matteo Sammartino. CONCUR 2020. [ Abstract ]
(2020) Generating Functions for Probabilistic Programs - Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman and Tobias Winkler. arXiv. [ Abstract ]
(2020) Separation and Renaming in Nominal Sets - Joshua Moerman and Jurriaan Rot. CSL 2020. [ Abstract ]
(2019) Residual Nominal Automata - Joshua Moerman and Matteo Sammartino. arXiv. [ Abstract ]
(2019) Separation and Renaming in Nominal Sets - Joshua Moerman and Jurriaan Rot. arXiv. [ Abstract ]
(2019) A (co)algebraic theory of succinct automata - Gerco van Heerdt, Joshua Moerman, Matteo Sammartino, and Alexandra Silva. JLAMP. [ Abstract ]
(2018) Fast Computations on Ordered Nominal Sets - David Venhoek, Joshua Moerman and Jurriaan Rot. ICTAC 2018. [ Abstract ]
(2018) Learning Product Automata - Joshua Moerman. ICGI 2018. [ Abstract ]
(2017) n-Complete Test Suites for IOCO - Petra van den Bos, Ramon Janssen and Joshua Moerman. ICTSS 2017. [ Abstract ]
(2017) Learning Product Automata - Joshua Moerman. LearnAut 2017 Poster. [ Abstract ]
(2017) Learning Nominal Automata - Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartek Klin and Michał Szynwelski. POPL 2017. [ Abstract ]
(2016) Minimal Separating Sequences for All Pairs of States - Rick Smetsers, Joshua Moerman and David N. Jansen. LATA 2016. [ Abstract ]
(2015) Applying Automata Learning in Embedded Control Software - Wouter Smeenk, Joshua Moerman, Frits Vaandrager and David N. Jansen. ICFEM 2015. [ Abstract ]
- 2020 September, Highlights. Residuality and Learning for Register Automata
- 2020 September, CONCUR. Residual Nominal Automata
- 2020 July, Radboud S^3. Residuality and Learning for Nondeterministic Register Automata
- 2020 March, D-CON. 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 FSM-based test methods
If you would like to have slides from any of my talks, feel free to send me a message.
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 up-sets of down-sets in a poset. This is a nice way to model alternating automata, for example.
See also my Research Blog.
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 Dold-Kan Correspondence, supervised by Moritz Groth. The Dold-Kan 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 ]