Small Strategies for Safety Games
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.
KeywordsLeaf Node Regular Language Winning Strategy Initial Vertex Automaton Learning
Unable to display preview. Download preview PDF.
- 3.Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Specify, compile, run: Hardware from PSL. ENTCS 190(4), 3–16 (2007)Google Scholar
- 9.Kearns, M., Vazirani, U.: An introduction to computational learning theory. The MIT Press, Cambridge (1994)Google Scholar
- 10.Kupferman, O., Lustig, Y., Vardi, M.Y., Yannakakis, M.: Temporal synthesis for bounded systems and environments. In: STACS. LIPIcs, vol. 9, pp. 615–626. Leibniz-Zentrum fuer Informatik (2011)Google Scholar
- 11.Myers, G., Badgett, T., Thomas, T., Sandler, C.: The art of software testing, vol. 28. John Wiley & Sons, Chichester (2004)Google Scholar