Efficient Synthesis for Monotone Transition Systems and Directed Safety Specifications

In this paper, we introduce an efficient algorithm for control policy synthesis for monotone transition systems and lower (upper) safety specifications. For a monotone transition system the sets of states and inputs are equipped with partial orders, moreover, the transitions preserve the ordering on the states. We propose a lazy algorithm that exploits priorities on the states and inputs. To compute the maximal controlled invariant set, only inputs with the lowest priorities are used. Then, starting from the states with the highest priorities, transitions are computed on-the-fly and only when a particular region of the state space needs to be explored. Once this set is computed, controller synthesis is straightforward by exploring different inputs and using their priorities. We prove the completeness of our algorithm w.r.t the classical safety algorithm. Finally, we illustrate the advantages of the proposed approach on a vehicle platooning problem.