Compositional automata learning of synchronous systems
From MaRDI portal
Recommendations
- Learning-based compositional verification for synchronous probabilistic systems
- Learning communicating state machines
- Computer Aided Verification
- Active automata learning as black-box search and lazy partition refinement
- Benchmarking combinations of learning and testing algorithms for active automata learning
Cites work
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- Active learning for extended finite state machines
- Compositional learning for interleaving parallel automata
- Exact DFA Identification Using SAT Solvers
- Grammatical inference. Learning automata and grammars.
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- scientific article; zbMATH DE number 1500652 (Why is no real title available?)
- Inferring Network Invariants Automatically
- Learning nominal automata
- Learning pomset automata
- Learning regular omega languages
- Learning regular sets from queries and counterexamples
- Linear Automaton Transformations
- The learnability of symbolic automata
- Verifying binarized neural networks by Angluin-style learning
Cited in
(5)
This page was built for publication: Compositional automata learning of synchronous systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535219)