Nearest Fixed Points and Concurrent Priority Games

DOI10.1007/978-3-319-22177-9_29zbMath1436.68213OpenAlexW2284877434MaRDI QIDQ2947896

Wiesław Zielonka, Bruno Karelovic

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22177-9_29

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Memoryless determinacy of finite parity games: another simple proof

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monadic second-order logic on tree-like structures
• Quantitative solution of omega-regular games
• A lattice-theoretical fixpoint theorem and its applications
• Qualitative concurrent parity games
• The determinacy of Blackwell games
• Rudiments of \(\mu\)-calculus

This page was built for publication: Nearest Fixed Points and Concurrent Priority Games