Skip to main content

Towards a Probabilistic Interpretation of Game Logic

  • Conference paper
  • First Online:
Relational and Algebraic Methods in Computer Science (RAMICS 2015)

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

Abstract

Game logic is a modal logic the modalities of which model the interaction of two players, Angel and Demon. It is known that game logic is not adequately interpreted through relation based Kripke models. The basic mechanism behind neighborhood models, which are used instead, is given through effectivity functions. We give a brief introduction to effectivity functions based on sets, indicate some of their coalgebraic properties, and move on to a definition of stochastic effectivity functions over general measurable spaces. An interpretation of game logics in terms of these effectivity functions is sketched, and their relationship to probabilistic Kripke models and to the interpretation of the PDL fragment is indicated.

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

Access this chapter

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. Doberkat, E.-E.: A stochastic interpretation of propositional dynamic logic: Expressivity. J. Symb. Logic 77(2), 687–716 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Doberkat, E.-E.: Algebraic properties of stochastic effectivity functions. J. Logic and Algebraic Progr. 83, 339–358 (2014)

    MathSciNet  MATH  Google Scholar 

  3. Doberkat, E.-E.: Special Topics in Mathematics for Computer Science: Sets, Categories, Topologies, Measures. Springer (in print, 2015)

    Google Scholar 

  4. Doberkat, E.-E., Sànchez Terraf, P.: Stochastic nondeterminism and effectivity functions. J. Logic and Computation (in print, 2015) (arxiv: 1405.7141)

    Google Scholar 

  5. Kozen, D.: A probabilistic PDL. J. Comp. Syst. Sci. 30(2), 162–178 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  6. Parikh, R.: The logic of games and its applications. In: Karpinski, M., van Leeuwen, J. (eds.) Topics in the Theory of Computation, vol. 24, pp. 111–140. Elsevier (1985)

    Google Scholar 

  7. Pauly, M., Parikh, R.: Game logic — an overview. Studia Logica 75, 165–182 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ernst-Erich Doberkat .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Doberkat, EE. (2015). Towards a Probabilistic Interpretation of Game Logic. In: Kahl, W., Winter, M., Oliveira, J. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2015. Lecture Notes in Computer Science(), vol 9348. Springer, Cham. https://doi.org/10.1007/978-3-319-24704-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24704-5_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24703-8

  • Online ISBN: 978-3-319-24704-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics