Quantitative solution of omega-regular games380872

DOI10.1145/380752.380871zbMath1323.68417OpenAlexW2074996640MaRDI QIDQ5176026

Luca de Alfaro, Rupak Majumdar

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

2-person games (91A05) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Graph Games and Reactive Synthesis ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Multi-valued model checking games ⋮ Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games ⋮ Concurrent games with tail objectives

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Quantitative solution of omega-regular games380872