40 citations · 156 across the 43 of their papers we have counts for
4 papers · 1 filter
A New Approach for Active Automata Learning Based on Apartness
Frits Vaandrager, Bharat Garhewal, Jurriaan Rot +1
We present , a new and simple approach to active automata learning. Instead of focusing on equivalence of observations, like the algorithm and its descendants, $…
On Star Expressions and Coalgebraic Completeness Theorems
Todd Schmid, Jurriaan Rot, Alexandra Silva
An open problem posed by Milner asks for a proof that a certain axiomatisation, which Milner showed is sound with respect to bisimilarity for regular expressions, is also complete.…
Expressivity of Quantitative Modal Logics: Categorical Foundations via Codensity and Approximation
Yuichi Komorida, Shin-ya Katsumata, Clemens Kupke +2
A modal logic that is strong enough to fully characterize the behavior of a system is called expressive. Recently, with the growing diversity of systems to be reasoned about (proba…
Learning Pomset Automata
Gerco van Heerdt, Tobias Kappé, Jurriaan Rot +1
We extend the L* algorithm to learn bimonoids recognising pomset languages. We then identify a class of pomset automata that accepts precisely the class of pomset languages recogni…