Qualitative concurrent parity games

DOI10.1145/1970398.1970404zbMath1351.68179OpenAlexW2029583849MaRDI QIDQ2946647

Luca de Alfaro, Krishnendu Chatterjee, 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

temporal logicgames on graphsconcurrent gamesparity objectives\(\omega\)-regular objectives

Mathematics Subject Classification ID

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

Related Items (8)

Graph Games and Reactive Synthesis ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ Nearest Fixed Points and Concurrent Priority Games ⋮ Universal algorithms for parity games and nested fixpoints ⋮ Unnamed Item ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games ⋮ Qualitative analysis of concurrent mean-payoff games

This page was built for publication: Qualitative concurrent parity games