Nearest fixed points and concurrent priority games

DOI10.1007/978-3-319-22177-9_29MaRDI QIDQ2947896zbMATH OpenOpenAlexFDO

Authors Bruno Karelovic, Wiesław Zielonka

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

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

Recommendations

• Deterministic Priority Mean-Payoff Games as Limits of Discounted Games
• Perfect Information Stochastic Priority Games
• The variable hierarchy for the games -calculus
• Qualitative concurrent parity games
• Quantitative stochastic parity games

Cites work

• scientific article; zbMATH DE number 3128726 (Why is no real title available?)
• scientific article; zbMATH DE number 1980933 (Why is no real title available?)
• scientific article; zbMATH DE number 2067974 (Why is no real title available?)
• scientific article; zbMATH DE number 3358265 (Why is no real title available?)
• A lattice-theoretical fixpoint theorem and its applications
• Monadic second-order logic on tree-like structures
• Qualitative concurrent parity games
• Quantitative solution of omega-regular games
• Rudiments of \(\mu\)-calculus
• The determinacy of Blackwell games

Cited in

(2)

• Characterizations of solutions for games with precedence constraints
• Memoryless determinacy of finite parity games: another simple proof

This page was built for publication: Nearest fixed points and concurrent priority games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947896)