Learning regular sets from queries and counterexamples
Information and Computation
An introduction to computational learning theory
An introduction to computational learning theory
Inference of Finite Automata Using Homing Sequences
Machine Learning: From Theory to Applications - Cooperative Research at Siemens and MIT
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
The Art of Software Testing
Specify, Compile, Run: Hardware from PSL
Electronic Notes in Theoretical Computer Science (ENTCS)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Memory reduction for strategies in infinite games
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Compositional algorithms for LTL synthesis
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
libalf: the automata learning framework
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Short witnesses and accepting lassos in ω-automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
We consider safety games on finite, edge-labeled graphs and present an algorithm based on automata learning to compute small strategies. Our idea is as follows: we incrementally learn regular sets of winning plays until a winning strategy can be derived. For this purpose we develop a modified version of Kearns and Vazirani's learning algorithm. Since computing a minimal strategy in this setting is hard (we prove that the corresponding decision problem is NP-complete), our algorithm, which runs in polynomial time, is an interesting and effective heuristic that yields small strategies in our experiments.