Partial order reduction
Technique used in formal verification of computer systems / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Partial order reduction?
Summarize this article for a 10 year old
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.
In explicit state space exploration, partial order reduction usually refers to the specific technique of expanding a representative subset of all enabled transitions. This technique has also been described as model checking with representatives.[1] There are various versions of the method, the so-called stubborn set method,[2] ample set method,[1] and persistent set method.[3]