The complexity of admissibility in Omega-regular games

DOI10.1145/2603088.2603143zbMath1401.68110arXiv1304.1682OpenAlexW2121894842MaRDI QIDQ4635606

Mathieu Sassolas, Romain Brenguier, Jean-François Raskin

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.1682

zbMATH Keywords

synthesissafetyLTLMuller gamesadmissible strategies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (11)

Dynamic hierarchical reactive controller synthesis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Existence of Weak Subgame Perfect Equilibria ⋮ On the existence of weak subgame perfect equilibria ⋮ Assume-admissible synthesis ⋮ Unnamed Item ⋮ Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives ⋮ Unnamed Item ⋮ A game-theoretic approach for the synthesis of complex systems

This page was built for publication: The complexity of admissibility in Omega-regular games