Computing Adequately Permissive Assumptions for Synthesis
Computing Adequately Permissive Assumptions for Synthesis
Abstract We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an $$\omega $$ -regular winning condition $$\varPhi $$ for the system player, we compute an $$\omega $$ …