Partial order reduction is a technique for reducing the state space explored in model checking, planning, or scheduling. It exploits cases where different orders of independent actions lead to equivalent states.
A technique for reducing the size of the state-space to be searched by a model checking or automated planning and scheduling algorithm. It exploits the commutativity of concurrently executed transitions, which result in the same state when executed in different orders.