11 citations · 37 across the 18 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, $…
Minimality Notions via Factorization Systems
Thorsten Wißmann
For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary…
Explaining Behavioural Inequivalence Generically in Quasilinear Time
Thorsten Wißmann, Stefan Milius, Lutz Schröder
We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabi…
Coalgebra Encoding for Efficient Minimization
Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann
Recently, we have developed an efficient generic partition refinement algorithm, which computes behavioural equivalence on a state-based system given as an encoded coalgebra, and i…