LearnLib
From MaRDI portal
Software:21892
swMATH9913MaRDI QIDQ21892FDOQ21892
Author name not available (Why is that?)
Cited In (14)
- A categorical framework for learning generalised tree automata
- Learning residual alternating automata
- Efficient active automata learning via mutation testing
- Automata Learning with Automated Alphabet Abstraction Refinement
- Learning deterministic probabilistic automata from a model checking perspective
- Active learning for extended finite state machines
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Enhancing Automata Learning by Log-Based Metrics
- Improving active Mealy machine learning for protocol conformance testing
- Learning One-Clock Timed Automata
- Predictive runtime enforcement
- A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
- Inferring regular languages and \(\omega\)-languages
- Automated synthesis of application-layer connectors from automata-based specifications
This page was built for software: LearnLib
