Qualitative concurrent parity games

DOI10.1145/1970398.1970404MaRDI QIDQ2946647zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Luca De Alfaro, Thomas A. Henzinger

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1970398.1970404

zbMATH Keywords

\(\omega\)-regular objectivesconcurrent gamesgames on graphsparity objectivestemporal logic

Mathematics Subject Classification ID

Temporal logic (03B44) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) 2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Qualitative concurrent parity games: bounded rationality
• Qualitative analysis of concurrent mean-payoff games
• Concurrent reachability games
• Quantitative solution of -regular games
• Quantitative stochastic parity games

Cited in

(22)

• Quantitative solution of omega-regular games
• A turn-based approach for qualitative time concurrent games
• Qualitative analysis of concurrent mean-payoff games
• Concurrent games with tail objectives
• Concurrent reachability games
• Robustness of structurally equivalent concurrent parity games
• Nearest fixed points and concurrent priority games
• Graph Games and Reactive Synthesis
• Symbolic model checking in non-Boolean domains
• Qualitative concurrent parity games: bounded rationality
• Concurrent Games with Tail Objectives
• scientific article; zbMATH DE number 1948169 (Why is no real title available?)
• Concurrent games and semi-random determinacy
• scientific article; zbMATH DE number 7204389 (Why is no real title available?)
• Quantitative solution of -regular games
• Quantitative stochastic parity games
• Combinations of Qualitative Winning for Stochastic Parity Games
• Foundations of Software Science and Computation Structures
• Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
• Universal algorithms for parity games and nested fixpoints
• Fast symbolic algorithms for omega-regular games under strong transition fairness
• CEGAR for compositional analysis of qualitative properties in Markov decision processes

This page was built for publication: Qualitative concurrent parity games

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