Semiring Provenance for B\"uchi Games: Strategy Analysis with Absorptive Polynomials
Erich Gr\"adel, Niels L\"ucking, Matthias Naaf

TL;DR
This paper applies semiring semantics to B"uchi games, enabling analysis of winning strategies and minimal effort strategies through fixed-point evaluations in polynomial semirings.
Contribution
It introduces a novel semiring-based approach to analyze strategies in B"uchi games, capturing not only winners but also how they win and the effort involved.
Findings
Semiring semantics provide detailed information about winning strategies.
Absorption-dominant strategies can be characterized using this approach.
The method enables applications like game synthesis and minimal modifications.
Abstract
This paper presents a case study for the application of semiring semantics for fixed-point formulae to the analysis of strategies in B\"uchi games. Semiring semantics generalizes the classical Boolean semantics by permitting multiple truth values from certain semirings. Evaluating the fixed-point formula that defines the winning region in a given game in an appropriate semiring of polynomials provides not only the Boolean information on who wins, but also tells us how they win and which strategies they might use. This is well-understood for reachability games, where the winning region is definable as a least fixed point. The case of B\"uchi games is of special interest, not only due to their practical importance, but also because it is the simplest case where the fixed-point definition involves a genuine alternation of a greatest and a least fixed point. We show that, in a precise…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
