Compositional automata learning of synchronous systems
From MaRDI portal
Publication:6535219
DOI10.1007/978-3-031-30826-0_3zbMath1541.68166MaRDI QIDQ6535219
Thomas Neele, Matteo Sammartino
Publication date: 24 November 2023
Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular omega languages
- Active learning for extended finite state machines
- Learning regular sets from queries and counterexamples
- Verifying binarized neural networks by Angluin-style learning
- Learning pomset automata
- Linear Automaton Transformations
- Exact DFA Identification Using SAT Solvers
- Inferring Network Invariants Automatically
- Learning nominal automata
- The learnability of symbolic automata
- Compositional learning for interleaving parallel automata
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
This page was built for publication: Compositional automata learning of synchronous systems
