Fair -regular games

DOI10.1007/978-3-031-57228-9_2MaRDI QIDQ6629447FDOQ6629447

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

Publication date: 30 October 2024

zbMATH Keywords

fairnessgames on graphstwo-player gamesparity games

Mathematics Subject Classification ID

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

Cites Work

• Borel determinacy
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Monadic second-order logic on tree-like structures
• Synthesis for Probabilistic Environments
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Verification, Model Checking, and Abstract Interpretation
• Computer Science Logic
• Solving Sequential Conditions by Finite-State Strategies
• Title not available (Why is that?)
• Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
• Logic for Programming, Artificial Intelligence, and Reasoning
• Code aware resource management
• Augmented finite transition systems as abstractions for control synthesis
• Control of \(\omega\)-automata under state fairness assumptions
• Symbolic control for stochastic systems via finite parity games
• Fast symbolic algorithms for omega-regular games under strong transition fairness

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)