Automata Learning through Counterexample Guided Abstraction Refinement

DOI10.1007/978-3-642-32759-9_4zbMath1372.68153OpenAlexW1893208258MaRDI QIDQ4647827

Faranak Heidarian, Fides Aarts, Harco Kuppens, Petur Olsen, Frits W. Vaandrager

Publication date: 8 November 2012

Published in: FM 2012: Formal Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32759-9_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Enhancing active model learning with equivalence checking using simulation relations ⋮ From languages to behaviors and back ⋮ Discovering directly-follows complete Petri nets from event data ⋮ Learning register automata: from languages to program structures ⋮ Improving active Mealy machine learning for protocol conformance testing ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction ⋮ Active learning for extended finite state machines ⋮ A Myhill-Nerode theorem for register automata and symbolic trace languages

Uses Software

• Daikon
• CUDD

This page was built for publication: Automata Learning through Counterexample Guided Abstraction Refinement