Approximate partial order reduction

We present a new partial order reduction method for reachability analysis of nondeterministic labeled transition systems over metric spaces. Nondeterminism arises from both the choice of the initial state and the choice of actions, and the number of executions to be explored grows exponentially with their length. We introduce a notion of ε -independence relation over actions that relates approximately commutative actions; ε -equivalent action sequences are obtained by swapping ε -independent consecutive action pairs. Our reachability algorithm generalizes individual executions to cover sets of executions that start from different, but δ -close initial states, and follow different, but ε -independent, action sequences. The constructed over-approximations can be made arbitrarily precise by reducing the δ, ε parameters. Exploiting both the continuity of actions and their approximate independence, the algorithm can yield an exponential reduction in the number of executions explored. We illustrate this with experiments on consensus, platooning, and distributed control examples.