Papers › Contract-Based Distributed Synthesis in Two-Objective Parity Games
Contract-Based Distributed Synthesis in Two-Objective Parity Games
Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present a novel method to compute assume-guarantee contracts in non-zerosum two-player games over finite graphs where each player has a different ω-regular winning condition. Given a game graph G and two parity winning conditions Φ₀ and Φ₁ over G, we compute contracted strategy-masks (csm) (Ψᵢ,Φᵢ) for each Player i. Within a csm, Φᵢ is a permissive strategy template which collects an infinite number of winning strategies for Player i under the assumption that Player 1-i chooses any strategy from the permissive assumption template Ψᵢ. The main feature of csm's is their power to fully decentralize all remaining strategy choices -- if the two player's csm's are compatible, they provide a pair of new local specifications Φ₀^∙ and Φ₁^∙ such that Player i can locally and fully independently choose any strategy satisfying Φᵢ^∙ and the resulting strategy profile is ensured to be winning in the original two-objective game (G,Φ₀,Φ₁). In addition, the new specifications Φᵢ^∙ are maximally cooperative, i.e., allow for the distributed synthesis of any cooperative solution. Further, our algorithmic computation of csm's is complete and ensured to terminate. We illustrate how the unique features of our synthesis framework effectively address multiple challenges in the context of \enquote{correct-by-design} logical control software synthesis for cyber-physical systems and provide empirical evidence that our approach possess desirable structural and computational properties compared to state-of-the-art techniques.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections