Exploring the scope for partial order reduction

Geldenhuys J. ; Hansen H. ; Valmari A. (2009)

Conference Paper

Partial order reduction methods combat state explosion by exploring only a part of the full state space. In each state a subset of enabled transitions is selected using well-established criteria. Typically such criteria are based on an upper approximation of dependencies between transitions. An additional heuristic is needed to ensure that currently disabled transitions stay disabled in the discarded execution paths. Usually rather coarse approximations and heuristics have been used, together with fast, simple algorithms that do not fully exploit the information available. More powerful approximations, heuristics, and algorithms had been suggested early on, but little is known whether their use pays off. We approach this question, not by trying alternative methods, but by investigating how much room the popular methods leave for better reduction. We do this via a series of experiments that mimic the ultimate reduction obtainable under certain conditions. © 2009 Springer-Verlag Berlin Heidelberg.

Please refer to this item in SUNScholar by using the following persistent URL: http://hdl.handle.net/10019.1/12300
This item appears in the following collections: