@inproceedings{2e53404dedf74c2e9d6bbaca1ada49be,
title = "On commutativity based edge lean search",
abstract = "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.",
author = "D. Bosnacki and E. Elkind and B. Genest and D. Peled",
year = "2007",
doi = "10.1007/978-3-540-73420-8_16",
language = "English",
isbn = "978-3-540-73419-2",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "158--170",
editor = "L. Arge and C. Cachin and T. Jurdzinski and A. Tarlecki",
booktitle = "Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007) 9-13 July 2007, Wroclaw, Poland",
note = "conference; ICALP 2007, Wroc{\l}aw, Poland; 2007-07-09; 2007-07-13 ; Conference date: 09-07-2007 Through 13-07-2007",
}