Nearest Fixed Points and Concurrent Priority Games

@inproceedings{Karelovic2015NearestFP,
  title={Nearest Fixed Points and Concurrent Priority Games},
  author={Bruno Karelovic and Wieslaw Zielonka},
  booktitle={FCT},
  year={2015}
}
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. 
Fixed Point Solution to Stochastic Priority Games
We define and examine a new class of two-player stochastic games that we call priority games. The priority games contain as proper subclasses the parity games studied in computer science [4] and also
Memoryless determinacy of finite parity games: Another simple proof
  • S. Haddad
  • Computer Science
    Inf. Process. Lett.
  • 2018

References

SHOWING 1-10 OF 13 REFERENCES
Quantitative solution of omega-regular games
STOCHASTIC GAMES WITH BOREL PAYOFFS
Consider a two-person zero-sum stochastic game with countable state space S, finite action sets A and B for players 1 and 2, respectively, and law of motion p.
Qualitative concurrent parity games
TLDR
This work considers two-player games played on a finite state space for an infinite number of rounds, and studies the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1.
SOME TOPICS IN TWO-PERSON GAMES
Abstract : Several loosely-related essays on the theory of finite, two-person games are presented. The topics covered are: (1) the block decomposition of symmetric games; (2) saddle points in
Tree automata, mu-calculus and determinacy
  • E. Emerson, C. Jutla
  • Mathematics, Computer Science
    [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
  • 1991
TLDR
It is shown that the propositional mu-calculus is equivalent in expressive power to finite automata on infinite trees, which provides a radically simplified, alternative proof of M.O. Rabin's (1989) complementation lemma for tree automata, which is the heart of one of the deepest decidability results.
Games, Probability and the Quantitative µ-Calculus qMµ
TLDR
It is shown for a finite-state system that the straightforward denotational interpretation of the quantitative µ-calculus is equivalent to an operational interpretation given as a turn-based gambling game between two players, and it is shown that memoriless strategies suffice for achieving the minimax value of a quantitative game, when the state space is finite.
A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS
1. A lattice-theoretical fixpoint theorem. In this section we formulate and prove an elementary fixpoint theorem which holds in arbitrary complete lattices. In the following sections we give various
A Novel Stochastic Game Via the Quantitative mu-calculus
Monadic second-order logic on tree-like structures
...
...