On Commutativity Based Edge Lean Search

  • Dragan Bošnački
  • Edith Elkind
  • Blaise Genest
  • Doron Peled
Conference paper

DOI: 10.1007/978-3-540-73420-8_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4596)
Cite this paper as:
Bošnački D., Elkind E., Genest B., Peled D. (2007) On Commutativity Based Edge Lean Search. In: Arge L., Cachin C., Jurdziński T., Tarlecki A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Dragan Bošnački
    • 1
  • Edith Elkind
    • 2
  • Blaise Genest
    • 3
  • Doron Peled
    • 4
  1. 1.Department of Biomedical Engineering, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB, EindhovenThe Netherlands
  2. 2.Department of Computer Science, University of SouthamptonUK
  3. 3.IRISA/CNRS, Campus de Beaulieu, 35042 Rennes CedexFrance
  4. 4.Department of Computer Science, Bar Ilan UniversityIsrael

Personalised recommendations