Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

Positional Determinacy of Games with Infinitely Many Priorities

Erich Graedel ; Igor Walukiewicz.
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is positionally determined if, from each position, one of the two&nbsp;[&hellip;]
Published on November 3, 2006

Typing weak MSOL properties

Sylvain Salvati ; Igor Walukiewicz.
We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of calls to built-in operations. Weak monadic second-order logic (wMSOL) is well suited to express properties of such trees. We&nbsp;[&hellip;]
Published on March 23, 2017

  • < Previous
  • 1
  • Next >