Skip to main content
SpringerLink
Log in

Small Strategies for Safety Games

  • Conference paper
Automated Technology for Verification and Analysis (ATVA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6996))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D.: Learning regular sets from queries and counterexamples. Information and computation 75(2), 87–106 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baier, C., Katoen, J.: Principles of model checking. The MIT Press, Cambridge (2008)

    MATH  Google Scholar 

  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 

  4. Bollig, B., Katoen, J.P., Kern, C., Leucker, M., Neider, D., Piegdon, D.R.: libalf: The automata learning framework. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 360–364. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Ehlers, R.: Short witnesses and accepting lassos in ω-automata. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 261–272. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Filiot, E., Jin, N., Raskin, J.F.: Compositional algorithms for LTL synthesis. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 112–127. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Research. LNCS, vol. 2500. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  8. Holtmann, M., Löding, C.: Memory reduction for strategies in infinite games. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 253–264. Springer, Heidelberg (2007)

    Chapter  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 

  12. Papadimitriou, C.H.: Computational complexity. John Wiley and Sons Ltd., Chichester (1995)

    MATH  Google Scholar 

  13. Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. In: Hanson, S.J., Rivest, R.L., Remmele, W. (eds.) MIT-Siemens 1993. LNCS, vol. 661, pp. 51–73. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik 7, RWTH Aachen University, Germany

    Daniel Neider

Authors
  1. Daniel Neider
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of California, Santa Barbara, CA, USA

    Tevfik Bultan

  2. Department of Computer Science and Information Engineering, National Chung Cheng University, 168 University Road, Min-Hsiung, 62102, Chiayi, Taiwan, ROC

    Pao-Ann Hsiung

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neider, D. (2011). Small Strategies for Safety Games. In: Bultan, T., Hsiung, PA. (eds) Automated Technology for Verification and Analysis. ATVA 2011. Lecture Notes in Computer Science, vol 6996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24372-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24372-1_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24371-4

  • Online ISBN: 978-3-642-24372-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation