Concurrent games with specific winning conditions can be determined using Borel sets of configurations, as long as they are race-free and bounded-concurrent. The researchers proved this by reducing the problem to tree games, which in turn rely on the determinacy of Gale-Stewart games.