Learning Automata with Side-Effects - Coalgebraic Methods in Computer Science Access content directly
Conference Papers Year : 2020

Learning Automata with Side-Effects


Automata learning has been successfully applied in the verification of hardware and software. The size of the automaton model learned is a bottleneck for scalability, and hence optimizations that enable learning of compact representations are important. This paper exploits monads, both as a mathematical structure and a programming construct, to design and prove correct a wide class of such optimizations. Monads enable the development of a new learning algorithm and correctness proofs, building upon a general framework for automata learning based on category theory. The new algorithm is parametric on a monad, which provides a rich algebraic structure to capture non-determinism and other side-effects. We show that this allows us to uniformly capture existing algorithms, develop new ones, and add optimizations.
Fichier principal
Vignette du fichier
493577_1_En_5_Chapter.pdf (451.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03232354 , version 1 (21-05-2021)





Gerco Van Heerdt, Matteo Sammartino, Alexandra Silva. Learning Automata with Side-Effects. 15th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2020, Dublin, Ireland. pp.68-89, ⟨10.1007/978-3-030-57201-3_5⟩. ⟨hal-03232354⟩
31 View
18 Download



Gmail Facebook X LinkedIn More