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 while traversing considerably fewer edges. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Bošnački, D., Elkind, E., Genest, B., & Peled, D. (2007). On commutativity based edge lean search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 158–170). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_16
Mendeley helps you to discover research relevant for your work.