Most General Winning Secure Equilibria Synthesis in Graph Games
SP Nayak, AK Schmuck - … Conference on Tools and Algorithms for the …, 2024 - Springer
This paper considers the problem of co-synthesis in k-player games over a finite graph
where each player has an individual ω-regular specification ϕ i. In this context, a secure …
where each player has an individual ω-regular specification ϕ i. In this context, a secure …