Automata Learning with Automated Alphabet Abstraction Refinement

DOI10.1007/978-3-642-18275-4_19zbMath1317.68096OpenAlexW3136212788MaRDI QIDQ3075487

Falk Howar, Maik Merten, Bernhard Steffen

Publication date: 15 February 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18275-4_19

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (8)

Inferring Canonical Register Automata ⋮ Inferring Symbolic Automata ⋮ Enhancing active model learning with equivalence checking using simulation relations ⋮ From languages to behaviors and back ⋮ Learning register automata: from languages to program structures ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction ⋮ Active learning for extended finite state machines ⋮ Efficient active automata learning via mutation testing

Uses Software

• LearnLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning regular sets from queries and counterexamples
• Inference of finite automata using homing sequences
• Model-based testing of reactive systems. Advanced lectures.
• Linear Automaton Transformations
• Counterexample-guided abstraction refinement for symbolic model checking
• Automated Assume-Guarantee Reasoning by Abstraction Refinement
• Lazy abstraction
• Synthesis of interface specifications for Java classes
• Inference of Event-Recording Automata Using Timed Decision Trees

This page was built for publication: Automata Learning with Automated Alphabet Abstraction Refinement