Skip to main content

Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information

  • Chapter

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

Abstract

Nondeterministic concurrent strategies—those strategies compatible with copy-cat behaving as identity w.r.t. composition—have been characterised as certain maps of event structures. This leads to a bicategory of general concurrent games in which the maps are nondeterministic concurrent strategies. This paper explores the consequences of extending concurrent games with (1) winning, losing and, implicitly, neutral configurations, and (2) access levels, to address situations where Player or Opponent have imperfect information as to what has occurred in the game. In both cases winning strategies are shown to form bicategories of games. The bicategories become equivalent to order-enriched categories when restricted to deterministic strategies.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Winskel, G.: Event structures, stable families and games. Lecture notes, Comp Science Dept, Aarhus University (2011), http://daimi.au.dk/~gwinskel

  2. Conway, J.: On Numbers and Games. A K Peters, Wellesley (2000)

    Google Scholar 

  3. Winskel, G.: Event Structure Semantics for CCS and Related Languages. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140. Springer, Heidelberg (1982)

    Google Scholar 

  4. Melliès, P.A.: Asynchronous games 2: The true concurrency of innocence. Theor. Comput. Sci. 358(2-3), 200–228 (2006)

    CrossRef  MATH  Google Scholar 

  5. Rideau, S., Winskel, G.: Concurrent strategies. In: LICS 2011. IEEE Computer Society (2011)

    Google Scholar 

  6. Clairambault, P., Gutierrez, J., Winskel, G.: The winning ways of concurrent games (submitted, 2012)

    Google Scholar 

  7. Winskel, G.: Events, causality and symmetry. Comput. J. 54(1), 42–57 (2011)

    CrossRef  Google Scholar 

  8. Abramsky, S., Melliès, P.A.: Concurrent games and full completeness. In: LICS 1999. IEEE Computer Society (1999)

    Google Scholar 

  9. Melliès, P.-A., Mimram, S.: Asynchronous Games: Innocence Without Alternation. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 395–411. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  10. Abramsky, S.: Semantics of interaction. In: Pitts, A., Dybjer, P. (eds.) Semantics and Logics of Computation. Publications of the Newton Institute (1997)

    Google Scholar 

  11. Hyland, M.: Game semantics. In: Pitts, A., Dybjer, P. (eds.) Semantics and Logics of Computation. Publications of the Newton Institute (1997)

    Google Scholar 

  12. Abramsky, S., Jagadeesan, R.: Game semantics for access control. Electronic Notes in Theoretical Computer Science 249, 135–156 (2009)

    CrossRef  Google Scholar 

  13. Joyal, A.: Remarques sur la théorie des jeux à deux personnes. Gazette des sciences mathématiques du Québec 1(4) (1997)

    Google Scholar 

  14. Hintikka, J., Sandu, G.: A revolution in logic? Nordic J. of Phil. Logic 1 (1996)

    Google Scholar 

  15. Clairambault, P., Gutierrez, J., Winskel, G.: Imperfect information in logic and concurrent games (submitted, 2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Winskel, G. (2012). Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information. In: Constable, R.L., Silva, A. (eds) Logic and Program Semantics. Lecture Notes in Computer Science, vol 7230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29485-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29485-3_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29484-6

  • Online ISBN: 978-3-642-29485-3

  • eBook Packages: Computer ScienceComputer Science (R0)