A new approach for active automata learning based on apartness
From MaRDI portal
Publication:6535565
Recommendations
- Active automata learning as black-box search and lazy partition refinement
- \(L^*\)-based learning of Markov decision processes
- Active learning of one-clock timed automata using constraint solving
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Automata Learning: A Categorical Perspective
Cites work
- scientific article; zbMATH DE number 1008506 (Why is no real title available?)
- scientific article; zbMATH DE number 1497485 (Why is no real title available?)
- scientific article; zbMATH DE number 7407787 (Why is no real title available?)
- A note on two problems in connexion with graphs
- Active learning for extended finite state machines
- Automata Learning
- Automata Learning through Counterexample Guided Abstraction Refinement
- Benchmarks for automata learning and conformance testing
- CALF: categorical automata learning framework
- CGE: a sequential learning algorithm for Mealy automata
- Coalgebra learning via duality
- FM 2009: Formal methods. Second world congress, Eindhoven, The Netherlands, November 2--6, 2009. Proceedings
- Fundamental Approaches to Software Engineering
- Guarded commands, nondeterminacy and formal derivation of programs
- Inference of finite automata using homing sequences
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Learning I/O automata
- Learning Mealy machines with one timer
- Learning nominal automata
- Learning regular sets from queries and counterexamples
- Learning weighted automata
- Learning weighted automata over principal ideal domains
- Minimal separating sequences for all pairs of states
- Model learning as a satisfiability modulo theories problem
- Models, algorithms, logics and tools. Essays dedicated to Kim Guldstrand Larsen on the occasion of his 60th birthday
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- On the learnability of infinitary regular sets
- Regular inference as vertex coloring
- Testing finite-state machines: state identification and verification
- The existence of refinement mappings
- The learnability of symbolic automata
- Zur intuitionistischen Axiomatik der projektiven Geometrie.
Cited in
(3)
This page was built for publication: A new approach for active automata learning based on apartness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535565)
