Sciweavers

Share
ICALP
2007
Springer

On Commutativity Based Edge Lean Search

9 years 9 months ago
On Commutativity Based Edge Lean Search
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optimizing the search may be crucial. We consider the problem of visiting all states in a graph where edges are generated by actions and the (reachable) states are not known in advance. Some of the actions may commute, i.e., they result in the same state for every order in which they are taken (this is the case when the actions are performed independently by different processes). We show how to use commutativity to achieve full coverage of the states traversing considerably fewer edges.
Dragan Bosnacki, Edith Elkind, Blaise Genest, Doro
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ICALP
Authors Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled
Comments (0)
books