Automata learning with automated alphabet abstraction refinement

DOI10.1007/978-3-642-18275-4_19zbMATH Open1317.68096OpenAlexW3136212788MaRDI QIDQ3075487FDOQ3075487

Authors: Falk Howar, Bernhard Steffen, Maik Merten 

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

Recommendations

• Automata Learning through Counterexample Guided Abstraction Refinement
• Computer Aided Verification
• Domain-specific optimization in automata learning.
• A theory of history dependent abstractions for learning interface automata
• When does abstraction help?

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (17)

• Efficient active automata learning via mutation testing
• Enhancing active model learning with equivalence checking using simulation relations
• From languages to behaviors and back
• A theory of history dependent abstractions for learning interface automata
• Active learning for extended finite state machines
• Generating models of infinite-state communication protocols using regular inference with abstraction
• Automata Learning through Counterexample Guided Abstraction Refinement
• Domain-specific optimization in automata learning.
• Enhancing Automata Learning by Log-Based Metrics
• Learning register automata: from languages to program structures
• A Context-Free Symbiosis of Runtime Verification and Automata Learning
• Reverse Engineering Through Automata Learning
• Automata Learning: A Categorical Perspective
• Improving Symbolic Automata Learning with Concolic Execution
• Inferring Symbolic Automata
• Inferring canonical register automata
• Computer Aided Verification

Uses Software

• LearnLib

This page was built for publication: Automata learning with automated alphabet abstraction refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075487)