On commutativity based edge lean search

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

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

On commutativity based edge lean search

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings
Publisher	Springer Verlag
Pages	158-170
Number of pages	13
ISBN (Print)	3540734198, 9783540734192
DOIs	https://doi.org/10.1007/978-3-540-73420-8_16
State	Published - 2007
Event	34th International Colloquium on Automata, Languages and Programming, ICALP 2007 - Wroclaw, Poland Duration: 9 Jul 2007 → 13 Jul 2007

Publication series

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

Conference

Conference	34th International Colloquium on Automata, Languages and Programming, ICALP 2007
Country/Territory	Poland
City	Wroclaw
Period	9/07/07 → 13/07/07

Access to Document

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

Cite this

Bošnački, D., Elkind, E., Genest, B., & Peled, D. (2007). On commutativity based edge lean search. In Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings (pp. 158-170). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4596 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_16

@inproceedings{8557a02d776b41cebec910b8d3abe658,

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 = "Dragan Bo{\v s}na{\v c}ki and Edith Elkind and Blaise Genest and Doron Peled",

year = "2007",

doi = "10.1007/978-3-540-73420-8_16",

language = "אנגלית",

isbn = "3540734198",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "158--170",

booktitle = "Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings",

address = "גרמניה",

note = "34th International Colloquium on Automata, Languages and Programming, ICALP 2007 ; Conference date: 09-07-2007 Through 13-07-2007",

}

Bošnački, D, Elkind, E, Genest, B & Peled, D 2007, On commutativity based edge lean search. in Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4596 LNCS, Springer Verlag, pp. 158-170, 34th International Colloquium on Automata, Languages and Programming, ICALP 2007, Wroclaw, Poland, 9/07/07. https://doi.org/10.1007/978-3-540-73420-8_16

On commutativity based edge lean search. / Bošnački, Dragan; Elkind, Edith; Genest, Blaise et al.
Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings. Springer Verlag, 2007. p. 158-170 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4596 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 -

Bošnački D, Elkind E, Genest B, Peled D. On commutativity based edge lean search. In Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings. Springer Verlag. 2007. p. 158-170. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-73420-8_16

On commutativity based edge lean search

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this