Joshua Moerman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Joshua Moerman has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Bartek Klin
University of Warsaw
3 shared publications - David N. Jansen
Institute of Software, Chinese Academy of Sciences
2 shared publications - Joost-Pieter Katoen
RWTH Aachen University
2 shared publications - Jurriaan Rot
Radboud University Nijmegen The Netherlands
2 shared publications - Matteo Sammartino
Royal Holloway University of London
2 shared publications - Mikołaj Bojańczyk
University of Warsaw, Warsaw, Poland
2 shared publications
Latest Publications
- Open Access
Output-decomposed Learning of Mealy Machines
We present an active automata learning algorithm which learns a decomposition of a finite state machine, based on projecting onto individual outputs. This is dual to a recent compositional learning algorithm by Labbaf et al. (2023). When projecting the outputs to a smaller set, the model itself is reduced in size. By having several such projections, we do not lose any information and the full system can be reconstructed. Depending on the structure of the system this reduces the number of queries drastically, as shown by a preliminary evaluation of the algorithm.
Open AccessOutput-decomposed Learning of Mealy Machines
We present an active automata learning algorithm which learns a decomposition of a finite state machine, based on projecting onto individual outputs. This is dual to a recent compositional learning algorithm by Labbaf et al. (2023). When projecting the outputs to a smaller set, the model itself is reduced in size. By having several such projections, we do not lose any information and the full system can be reconstructed. Depending on the structure of the system this reduces the number of queries drastically, as shown by a preliminary evaluation of the algorithm.
- Open Access
- 6 May 2024
- Published by Centre pour la Communication Scientifique Directe (CCSD) in TheoretiCS
- Vol. ume 3
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata for infinite alphabets. The algorithm runs in exponential time, and in polynomial time for a fixed number of registers. As a special case, we can decide, with the same complexity, language equivalence for unambiguous register automata, which improves previous results in three ways: (a) we allow for order comparisons on atoms, and not just equality; (b) the complexity is exponentially better; and (c) we allow automata with guessing.
- 6 May 2024
- Published by Centre pour la Communication Scientifique Directe (CCSD) in TheoretiCS
- Vol. ume 3
Open AccessOrbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata for infinite alphabets. The algorithm runs in exponential time, and in polynomial time for a fixed number of registers. As a special case, we can decide, with the same complexity, language equivalence for unambiguous register automata, which improves previous results in three ways: (a) we allow for order comparisons on atoms, and not just equality; (b) the complexity is exponentially better; and (c) we allow automata with guessing.
- 7 September 2022
- Published by Springer Nature
- p. 450-466
State Identification and Verification with Satisfaction
- 7 September 2022
- Published by Springer Nature
- p. 450-466
State Identification and Verification with Satisfaction
- Open Access
Fast Computations on Ordered Nominal Sets
We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In contrast to previous approaches, we work directly at the level of orbits, which allows for an accurate complexity analysis. The approach is implemented as the library ONS (Ordered Nominal Sets). Our main motivation is nominal automata, which are models for recognising languages over infinite alphabets. We evaluate ONS in two applications: minimisation of automata and active automata learning. In both cases, ONS is competitive compared to existing implementations and outperforms them for certain classes of inputs.
Open AccessFast Computations on Ordered Nominal Sets
We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In contrast to previous approaches, we work directly at the level of orbits, which allows for an accurate complexity analysis. The approach is implemented as the library ONS (Ordered Nominal Sets). Our main motivation is nominal automata, which are models for recognising languages over infinite alphabets. We evaluate ONS in two applications: minimisation of automata and active automata learning. In both cases, ONS is competitive compared to existing implementations and outperforms them for certain classes of inputs.
- Open Access
- 3 February 2022
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Logical Methods in Computer Science
- Vol. ume 18, Is (1)
Residuality and Learning for Nondeterministic Nominal Automata
We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularly challenging for languages recognised by nondeterministic automata. To answer it, we develop the theory of residual nominal automata, a subclass of nondeterministic nominal automata. We prove that this class has canonical representatives, which can always be constructed via a finite number of observations. This property enables active learning algorithms, and makes up for the fact that residuality -- a semantic property -- is undecidable for nominal automata. Our construction for canonical residual automata is based on a machine-independent characterisation of residual languages, for which we develop new results in nominal lattice theory. Studying residuality in the context of nominal languages is a step towards a better understanding of learnability of automata with some sort of nondeterminism.
- 3 February 2022
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Logical Methods in Computer Science
- Vol. ume 18, Is (1)
Open AccessResiduality and Learning for Nondeterministic Nominal Automata
We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularly challenging for languages recognised by nondeterministic automata. To answer it, we develop the theory of residual nominal automata, a subclass of nondeterministic nominal automata. We prove that this class has canonical representatives, which can always be constructed via a finite number of observations. This property enables active learning algorithms, and makes up for the fact that residuality -- a semantic property -- is undecidable for nominal automata. Our construction for canonical residual automata is based on a machine-independent characterisation of residual languages, for which we develop new results in nominal lattice theory. Studying residuality in the context of nominal languages is a step towards a better understanding of learnability of automata with some sort of nondeterminism.
- 14 January 2022
- Published by Springer Nature
- p. 127-150
Gradient-Descent for Randomized Controllers Under Partial Observability
- 14 January 2022
- Published by Springer Nature
- p. 127-150
Gradient-Descent for Randomized Controllers Under Partial Observability
- Open Access
- 29 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-13
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata for infinite alphabets. The algorithm runs in exponential time, and in polynomial time for a fixed number of registers. As a special case, we can decide, with the same complexity, language equivalence for unambiguous register automata, which improves previous results in three ways: (a) we allow for order comparisons on atoms, and not just equality; (b) the complexity is exponentially better; and (c) we allow automata with guessing.
- 29 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-13
Open AccessOrbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata for infinite alphabets. The algorithm runs in exponential time, and in polynomial time for a fixed number of registers. As a special case, we can decide, with the same complexity, language equivalence for unambiguous register automata, which improves previous results in three ways: (a) we allow for order comparisons on atoms, and not just equality; (b) the complexity is exponentially better; and (c) we allow automata with guessing.
- 13 February 2021
- Published by Springer Nature
- p. 231-248
Generating Functions for Probabilistic Programs
- 13 February 2021
- Published by Springer Nature
- p. 231-248
Generating Functions for Probabilistic Programs
- 1 June 2019
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 105, 112-125
A (co)algebraic theory of succinct automata
- 1 June 2019
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 105, 112-125
A (co)algebraic theory of succinct automata
- Open Access
- 28 November 2018
- Published by Springer Nature in Software Quality Journal
- Vol. 27 (2) , 563-588
n-Complete test suites for IOCO
- 28 November 2018
- Published by Springer Nature in Software Quality Journal
- Vol. 27 (2) , 563-588
Open Accessn-Complete test suites for IOCO