Non-Zero Sum Games for Reactive Synthesis
From MaRDI portal
Publication:2798706
DOI10.1007/978-3-319-30000-9_1zbMath1435.68147arXiv1512.05568OpenAlexW2218268032MaRDI QIDQ2798706
Mathieu Sassolas, Lorenzo Clemente, Guillermo A. Pérez, Mickael Randour, Ocan Sankur, Paul Hunter, Romain Brenguier, Jean-François Raskin
Publication date: 13 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.05568
Games involving graphs (91A43) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (12)
On the comparison of discounted-sum automata with multiple discount factors ⋮ Unnamed Item ⋮ Quantitative vs. weighted automata ⋮ Unnamed Item ⋮ On the Existence of Weak Subgame Perfect Equilibria ⋮ On the existence of weak subgame perfect equilibria ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions ⋮ Infinite-Duration Bidding Games ⋮ A game-theoretic approach for the synthesis of complex systems
This page was built for publication: Non-Zero Sum Games for Reactive Synthesis