Obliging games

DOI10.1007/978-3-642-15375-4_20MaRDI QIDQ3584937zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Florian Horn, Christof Löding

Publication date 31 August 2010

Published in CONCUR 2010 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15375-4_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) 2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Obligation Blackwell games and p-automata
• Tools and Algorithms for the Construction and Analysis of Systems
• Finitary winning in \({\omega}\)-regular games
• On the synthesis of strategies in infinite games
• Admissible Strategies in Infinite Games over Graphs

Cited in

(7)

• Restricted housewapping games
• On the relation between reactive synthesis and supervisory control of non-terminating processes
• Contrary-To-Duties in Games
• Obligation Blackwell games and p-automata
• Adaptive strategies for rLTL games
• Computing adequately permissive assumptions for synthesis
• Faster and smaller solutions of obliging games

This page was built for publication: Obliging games

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