Corpus ID: 125843546

Optimizing Automata Learning via Monads.

  title={Optimizing Automata Learning via Monads.},
  author={Gerco van Heerdt and Matteo Sammartino and A. Silva},
  journal={arXiv: Formal Languages and Automata Theory},
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, prove correct, and implement a wide class of such optimizations. The former perspective on monads allows us to develop a new algorithm and… Expand
2 Citations
Learning Weighted Automata over Principal Ideal Domains
  • 4
  • PDF
A (co)algebraic theory of succinct automata
  • 2
  • PDF


Freer monads, more extensible effects
  • 70
  • Highly Influential
  • PDF
Inference of Finite Automata Using Homing Sequences
  • 160
  • Highly Influential
  • PDF
The Open-Source LearnLib - A Framework for Active Automata Learning
  • 79
  • PDF
Automated Reverse Engineering using Lego®
  • 34
  • PDF
Formal Models of Bank Cards for Free
  • F. Aarts, Joeri de Ruiter, E. Poll
  • Computer Science
  • 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops
  • 2013
  • 73
  • PDF
Reasoning about online algorithms with weighted automata
  • 47
  • PDF
Angluin-Style Learning of NFA
  • 95
  • PDF
Model Checking Linear-Time Properties of Probabilistic Systems
  • 23
Quantitative Languages
  • 107
  • PDF