Partial order reduction

Technique used in formal verification of computer systems

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 that result in the same state when executed in different orders.

This keyword could refer to multiple things. Here are some suggestions: