 Partial order reduction

In computer science, partial order reduction is 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.