LearnLib
From MaRDI portal
Cited in
(42)- A categorical framework for learning generalised tree automata
- Learning residual alternating automata
- Efficient active automata learning via mutation testing
- Learning one-clock timed automata
- 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
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- jETI
- Rabbit
- JTorX
- TAXYS
- Daikon
- XMPP
- BULL
- libalf
- LinAIG
- NModel
- opaal
- Synthia
- ADABU
- RALib
- MuACOsm
- Sigma*
- CALF
- LEVER
- ITS-Tools
- Copilot
- mut-learn
- prob-black-reach
- SFADiff
- TarTar
- KERNELC
- MQTT
- Enhancing Automata Learning by Log-Based Metrics
- Improving active Mealy machine learning for protocol conformance testing
- AALpy
- Predictive runtime enforcement
- DeepLog
- Inferring regular languages and \(\omega\)-languages
- Automata learning with automated alphabet abstraction refinement
- Automated synthesis of application-layer connectors from automata-based specifications
This page was built for software: LearnLib
