Skip to main content
SpringerLink
Log in

Nearest Fixed Points and Concurrent Priority Games

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2015)

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

Included in the following conference series:

  • 638 Accesses

Abstract

As it is known the values of different states in parity games (deterministic parity games, or stochastic perfect information parity games or concurrent parity games) can be expressed by formulas of \(\mu \)-calculus – a fixed point calculus alternating the greatest and the least fixed points of monotone mappings on complete lattices.

In this paper we examine concurrent priority games that generalize parity games and we relate the value of such games to a new form of fixed point calculus – the nearest fixed point calculus.

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 EPUB and 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

References

  1. Emerson, E., Jutla, C.: Tree automata, mu-calculus and determinacy. In: FOCS 1991, pp. 368–377. IEEE Computer Society Press (1991)

    Google Scholar 

  2. Walukiewicz, I.: Monadic second-order logic on tree-like structures. Theoret. Comput. Sci. 275, 311–346 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. McIver, A., Morgan, C.: Games, probability and the quantitative \(\mu \)-calculus qmu. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol. 2514, pp. 292–310. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. McIver, A., Morgan, C.: A novel stochastic game via the quantitative mu-calculus. In: Cerone, A., Wiklicky, H., (eds.) Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005), ENTCS, vol. 153(2), pp. 195–212. Elsevier (2005)

    Google Scholar 

  5. de Alfaro, L., Majumdar, R.: Quantitative solution to omega-regular games. J. Comput. Syst. Sci. 68, 374–397 (2004)

    Article  MATH  Google Scholar 

  6. Chatterjee, K., de Alfaro, L., Henzinger, T.: Qualitative concurrent parity games. ACM Trans. Comput. Logic 12, 28:1–28:51 (2011)

    Article  Google Scholar 

  7. Everett, H.: Recursive games. In: Contributions to the Theory of Games, vol. III, pp. 47–78. Princeton University Press (1957)

    Google Scholar 

  8. Martin, D.: The determinacy of Blackwell games. J. Symbolic Logic 63(4), 1565–1581 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Maitra, A., Sudderth, W.: Stochastic games with Borel payoffs. In: Neyman, A., Sorin, S. (eds.) Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, vol. 570, pp. 367–373. Kluwer Academic Publishers (2004)

    Google Scholar 

  10. Tarski, A.: A lattice-theoretical fixpoint theoem and its aplications. Pacific J. Math. 5, 285–309 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  11. Arnold, A., Niwiński, D.: Rudiments of mu-calculus. Studies in Logic and the Foundations of Mathematics, vol. 146. Elsevier (2001)

    Google Scholar 

  12. Parthasarathy, T., Raghavan, T.: Some Topics in Two-Person Games. Elsevier, New York (1971)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université Paris Diderot, Paris 7, France

    Bruno Karelovic & Wiesław Zielonka

Authors
  1. Bruno Karelovic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wiesław Zielonka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wiesław Zielonka .

Editor information

Editors and Affiliations

  1. Université Paris Diderot, Paris, France

    Adrian Kosowski

  2. Université Bordeaux 1, Talence, France

    Igor Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Karelovic, B., Zielonka, W. (2015). Nearest Fixed Points and Concurrent Priority Games. In: Kosowski, A., Walukiewicz, I. (eds) Fundamentals of Computation Theory. FCT 2015. Lecture Notes in Computer Science(), vol 9210. Springer, Cham. https://doi.org/10.1007/978-3-319-22177-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22177-9_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22176-2

  • Online ISBN: 978-3-319-22177-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation