2014 | OriginalPaper | Buchkapitel
Tutorial: Automata Learning in Practice
verfasst von : Falk Howar, Malte Isberner, Bernhard Steffen
Erschienen in: Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The paper reviews active automata learning with a particular focus on sources of redundancy. In particular, it gives an intuitive account of TTT, an algorithm based on three tree structures which concisely capture all the required information. This guarantees minimal memory consumption and it drastically reduces the length of membership queries, in particular in application scenarios like monitoring-based learning, where long counter examples arise. The essential steps and the impact of TTT are illustrated via experimentation with
LearnLib
, a free, open source Java library for active automata learning.