2014 | OriginalPaper | Buchkapitel
Algorithms for Inferring Register Automata
A Comparison of Existing Approaches
verfasst von : Fides Aarts, Falk Howar, Harco Kuppens, Frits Vaandrager
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
In recent years, two different approaches for learning register automata have been developed: as part of the LearnLib tool algorithms have been implemented that are based on the Nerode congruence for register automata, whereas the Tomte tool implements algorithms that use counterexample-guided abstraction refinement to automatically construct appropriate mappers. In this paper, we compare the LearnLib and Tomte approaches on a newly defined set of benchmarks and highlight their differences and respective strengths.