Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Computer Aided Verification

CAV 2012: Computer Aided Verification pp 1Cite as

  1. Home
  2. Computer Aided Verification
  3. Conference paper
Synthesis and Some of Its Challenges

Synthesis and Some of Its Challenges

  • Wolfgang Thomas18 
  • Conference paper
  • 3571 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7358)

Abstract

The advent of a methodology of automatic synthesis (of state-based systems) adds a number of interesting facets to the setting of model-checking. In this talk we focus on some conceptual aspects arising from the basic scenario of strategy synthesis in infinite-duration two-player games, as a natural extension of model-checking. The starting point is the simple observation that modelchecking asks about the (non-) emptiness of sets while synthesis asks for a certain kind of uniformization of relations by functions. This raises a large number of questions on the classification of (word-) functions (which serve as strategies in games). We discuss basic results and recent progress, emphasizing two aspects: the definability of strategies and their “complexity” in various dimensions. These results are as yet preliminary, and we end by listing unresolved problems, for example on the logic-representation of strategies.

Keywords

  • Infinite games
  • winning strategies
  • uniformization problem
  • model-checking

Download conference paper PDF

Author information

Authors and Affiliations

  1. RWTH Aachen University, Lehrstuhl Informatik 7, 52056, Aachen, Germany

    Wolfgang Thomas

Authors
  1. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Illinois at Urbana-Champaign, 3226 Siebel Center, 201 N. Goodwin Avenue, 61801-2302, Urbana, IL, USA

    P. Madhusudan

  2. Dept. of Electrical Engineering and Computer Science, University of California, Berkeley, 253 Cory Hall # 1770, 94720-1770, Berkeley, CA, USA

    Sanjit A. Seshia

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thomas, W. (2012). Synthesis and Some of Its Challenges. In: Madhusudan, P., Seshia, S.A. (eds) Computer Aided Verification. CAV 2012. Lecture Notes in Computer Science, vol 7358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31424-7_1

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-31424-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31423-0

  • Online ISBN: 978-3-642-31424-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature