TY - GEN
T1 - On commutativity based edge lean search
AU - Bošnački, Dragan
AU - Elkind, Edith
AU - Genest, Blaise
AU - Peled, Doron
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38149067479&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-73420-8_16
DO - 10.1007/978-3-540-73420-8_16
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:38149067479
SN - 3540734198
SN - 9783540734192
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 158
EP - 170
BT - Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings
PB - Springer Verlag
T2 - 34th International Colloquium on Automata, Languages and Programming, ICALP 2007
Y2 - 9 July 2007 through 13 July 2007
ER -