Active learning for extended finite state machines
From MaRDI portal
Publication:736459
Recommendations
Cites work
- scientific article; zbMATH DE number 2086942 (Why is no real title available?)
- scientific article; zbMATH DE number 2087513 (Why is no real title available?)
- scientific article; zbMATH DE number 910719 (Why is no real title available?)
- A fresh approach to learning register automata
- Active learning for extended finite state machines
- Automata Learning through Counterexample Guided Abstraction Refinement
- Automata learning with automated alphabet abstraction refinement
- Domain-specific optimization in automata learning.
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Improving active Mealy machine learning for protocol conformance testing
- Inference of finite automata using homing sequences
- Inferring canonical register automata
- Learning register automata: from languages to program structures
- Learning regular sets from queries and counterexamples
- Mining specifications
- Model-based testing of reactive systems. Advanced lectures.
- Reo: a channel-based coordination model for component composition
- Sigma*
- Software model checking
- Synthesis of interface specifications for Java classes
- The Daikon system for dynamic detection of likely invariants
Cited in
(28)- Enhancing active model learning with equivalence checking using simulation relations
- Never-stop context-free learning
- An active learning approach to synthesizing program contracts
- Polynomial-time equivalence testing for deterministic fresh-register automata
- Active learning for sound negotiations
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Compositional automata learning of synchronous systems
- Active learning for extended finite state machines
- Efficient active automata learning via mutation testing
- A Myhill-Nerode theorem for register automata and symbolic trace languages
- A new approach for active automata learning based on apartness
- \(L^*\)-based learning of Markov decision processes
- Learning communicating state machines
- Models of active learning in group-structured state spaces
- Inferring regular languages and \(\omega\)-languages
- A taxonomy and reductions for common register automata formalisms
- Learning symbolic automata
- Combining black-box and white-box techniques for learning register automata
- Fast computations on ordered nominal sets
- Grey-Box Learning of Register Automata
- Learning one-clock timed automata
- Fundamental results for learning deterministic extended finite state machines from queries
- Protocol state machine reverse engineering with a teaching-learning approach
- Active learning for deterministic bottom-up nominal tree automata
- A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
- Model checking, synthesis, and learning
- Automata and grammars for data words
- Active learning of nondeterministic finite state machines
This page was built for publication: Active learning for extended finite state machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736459)
