Games on Graphs: A Time-Efficient Algorithm for Solving Finite Reachability and Safety Games

In recent years, there has been a growing interest in games on graphs within the research community, fueled by their relevance in applications such as economics, politics, and epidemiology. This paper aims to comprehensively detail the design decisions involved in developing a time-efficient algorithm for solving finite reachability and safety games on graphs. The primary contribution of this work is the introduction of a novel algorithm that effectively addresses both reachability and safety ga...