40 citations · 156 across the 43 of their papers we have counts for
7 papers · 1 filter
Learning Weighted Automata over Principal Ideal Domains
Gerco van Heerdt, Clemens Kupke, Jurriaan Rot +1
In this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin's seminal \LStar\ algorithm works when the semiring is a…
Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics
Jorge A. Pérez, Jurriaan Rot
This volume contains the proceedings of EXPRESS/SOS 2019: the Combined 26th International Workshop on Expressiveness in Concurrency and the 16th Workshop on Structural Operational…
Separation and Renaming in Nominal Sets
Joshua Moerman, Jurriaan Rot
Nominal sets provide a foundation for reasoning about names. They are used primarily in syntax with binders, but also, e.g., to model automata over infinite alphabets. In this pape…
Completeness and Incompleteness of Synchronous Kleene Algebra
Jana Wagemaker, Marcello Bonsangue, Tobias Kappé +2
Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lo…
Tree Automata as Algebras: Minimisation and Determinisation
Gerco van Heerdt, Tobias Kappé, Jurriaan Rot +2
We study a categorical generalisation of tree automata, as -algebras for a fixed endofunctor endowed with initial and final states. Under mild assumptions about the base cat…
Fast Computations on Ordered Nominal Sets
David Venhoek, Joshua Moerman, Jurriaan Rot
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 c…