A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Parameterized complexity of games with monotonically ordered omega-regular objectives
2018
International Conference on Concurrency Theory
In recent years, two-player zero-sum games with multiple objectives have received a lot of interest as a model for the synthesis of complex reactive systems. In this framework, Player 1 wins if he can ensure that all objectives are satisfied against any behavior of Player 2. When this is not possible to satisfy all the objectives at once, an alternative is to use some preorder on the objectives according to which subset of objectives Player 1 wants to satisfy. For example, it is often natural
doi:10.4230/lipics.concur.2018.29
dblp:conf/concur/BruyereHR18
fatcat:4soidjklsjho3gkesl2bwtwahi