Search

• < Previous
• 1
• Next >

---

Parity and Streett Games with Costs

Nathanaël Fijalkow ; Martin Zimmermann.

We consider two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize the corresponding classical omega-regular conditions&nbsp;[&hellip;]

---

Good-for-games $\omega$-Pushdown Automata

Karoliina Lehtinen ; Martin Zimmermann.

We introduce good-for-games $\omega$-pushdown automata ($\omega$-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed so far. Good-for-gameness enables automata to be composed with games, trees, and other automata, applications which otherwise require&nbsp;[&hellip;]

---