Characterizing positionality in games of Infinite duration over infinite graphs

DOI10.46298/THEORETICS.23.3MaRDI QIDQ6566588

Pierre Ohlmann

Publication date: 3 July 2024

Published in: TheoretiCS (Search for Journal in Brave)

zbMATH Keywords

universal graphspositionalityinfinite duration games

Mathematics Subject Classification ID

Games involving graphs (91A43) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the positional determinacy of edge-labeled games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Finitary winning in ω-regular games
• Playing Safe
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Half-Positional Determinacy of Infinite Games
• Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
• Positional Determinacy of Games with Infinitely Many Priorities
• Solving Sequential Conditions by Finite-State Strategies
• Stochastic Games
• CONCUR 2005 – Concurrency Theory

Related Items (1)

Half-positional objectives recognized by deterministic Büchi automata

This page was built for publication: Characterizing positionality in games of Infinite duration over infinite graphs

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