Fair -regular games

DOI10.1007/978-3-031-57228-9_2MaRDI QIDQ6629447zbMATH OpenFDO

Authors Daniel Hausmann, Nir Piterman, Irmak Sağlam, Anne-Kathrin Schmuck

Publication date 30 October 2024

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

fairnessgames on graphstwo-player gamesparity games

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 4085004 (Why is no real title available?)
• Augmented finite transition systems as abstractions for control synthesis
• Borel determinacy
• Code aware resource management
• Computer Science Logic
• Control of -automata under state fairness assumptions
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Fast symbolic algorithms for omega-regular games under strong transition fairness
• Fully observable non-deterministic planning as assumption-based reactive synthesis
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Logic for Programming, Artificial Intelligence, and Reasoning
• Monadic second-order logic on tree-like structures
• Solving Sequential Conditions by Finite-State Strategies
• Symbolic control for stochastic systems via finite parity games
• Synthesis for Probabilistic Environments
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Fair \(\omega \)-regular games

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