On commutativity based edge lean search

Dragan Bošnački, Edith Elkind, Blaise Genest, Doron Peled

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

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.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings
PublisherSpringer Verlag
Pages158-170
Number of pages13
ISBN (Print)3540734198, 9783540734192
DOIs
StatePublished - 2007
Event34th International Colloquium on Automata, Languages and Programming, ICALP 2007 - Wroclaw, Poland
Duration: 9 Jul 200713 Jul 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4596 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference34th International Colloquium on Automata, Languages and Programming, ICALP 2007
Country/TerritoryPoland
CityWroclaw
Period9/07/0713/07/07

Fingerprint

Dive into the research topics of 'On commutativity based edge lean search'. Together they form a unique fingerprint.

Cite this