On commutativity based edge lean search

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

doi:10.1007/s10472-009-9167-0

On commutativity based edge lean search

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

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

The problem of state space search is fundamental to many areas of computer science, such as, e.g., AI and formal methods. Often, the state space to be searched is huge, so optimizing the search is an important issue. In this paper, we consider the problem of visiting all states in the setting where transitions between states 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. We show how to use commutativity to achieve full coverage of the states, while traversing a relatively small number of edges.

Original language	English
Pages (from-to)	187-210
Number of pages	24
Journal	Annals of Mathematics and Artificial Intelligence
Volume	56
Issue number	2
DOIs	https://doi.org/10.1007/s10472-009-9167-0
State	Published - Jun 2009

Bibliographical note

Funding Information:
Acknowledgements The work of the second author has been partially supported by EPSRC under grant GR/T07343/02 by ESRC under grant ES/F035845/1, and by NRF under grant NRFRF2009-08. The work of the third author has been partially supported by ANR SETI-06 DOTS. Part of this work has been done when the second and the fourth author were with the University of Warwick.

Funding

Acknowledgements The work of the second author has been partially supported by EPSRC under grant GR/T07343/02 by ESRC under grant ES/F035845/1, and by NRF under grant NRFRF2009-08. The work of the third author has been partially supported by ANR SETI-06 DOTS. Part of this work has been done when the second and the fourth author were with the University of Warwick.

Funders	Funder number
ANR SETI-06 DOTS
Engineering and Physical Sciences Research Council	GR/T07343/02
Economic and Social Research Council	ES/F035845/1, NRFRF2009-08

Keywords

Commutativity
Partial order reduction
State space search

Access to Document

10.1007/s10472-009-9167-0

Cite this

@article{7f1765c5da8241459e5e34465a23cfaf,

title = "On commutativity based edge lean search",

abstract = "The problem of state space search is fundamental to many areas of computer science, such as, e.g., AI and formal methods. Often, the state space to be searched is huge, so optimizing the search is an important issue. In this paper, we consider the problem of visiting all states in the setting where transitions between states 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. We show how to use commutativity to achieve full coverage of the states, while traversing a relatively small number of edges.",

keywords = "Commutativity, Partial order reduction, State space search",

author = "Dragan Bo{\v s}na{\v c}ki and Edith Elkind and Blaise Genest and Doron Peled",

note = "Funding Information: Acknowledgements The work of the second author has been partially supported by EPSRC under grant GR/T07343/02 by ESRC under grant ES/F035845/1, and by NRF under grant NRFRF2009-08. The work of the third author has been partially supported by ANR SETI-06 DOTS. Part of this work has been done when the second and the fourth author were with the University of Warwick.",

year = "2009",

month = jun,

doi = "10.1007/s10472-009-9167-0",

language = "אנגלית",

volume = "56",

pages = "187--210",

journal = "Annals of Mathematics and Artificial Intelligence",

issn = "1012-2443",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - On commutativity based edge lean search

AU - Bošnački, Dragan

AU - Elkind, Edith

AU - Genest, Blaise

AU - Peled, Doron

N1 - Funding Information: Acknowledgements The work of the second author has been partially supported by EPSRC under grant GR/T07343/02 by ESRC under grant ES/F035845/1, and by NRF under grant NRFRF2009-08. The work of the third author has been partially supported by ANR SETI-06 DOTS. Part of this work has been done when the second and the fourth author were with the University of Warwick.

PY - 2009/6

Y1 - 2009/6

N2 - The problem of state space search is fundamental to many areas of computer science, such as, e.g., AI and formal methods. Often, the state space to be searched is huge, so optimizing the search is an important issue. In this paper, we consider the problem of visiting all states in the setting where transitions between states 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. We show how to use commutativity to achieve full coverage of the states, while traversing a relatively small number of edges.

AB - The problem of state space search is fundamental to many areas of computer science, such as, e.g., AI and formal methods. Often, the state space to be searched is huge, so optimizing the search is an important issue. In this paper, we consider the problem of visiting all states in the setting where transitions between states 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. We show how to use commutativity to achieve full coverage of the states, while traversing a relatively small number of edges.

KW - Commutativity

KW - Partial order reduction

KW - State space search

UR - http://www.scopus.com/inward/record.url?scp=76649096675&partnerID=8YFLogxK

U2 - 10.1007/s10472-009-9167-0

DO - 10.1007/s10472-009-9167-0

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:76649096675

SN - 1012-2443

VL - 56

SP - 187

EP - 210

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

IS - 2

ER -

On commutativity based edge lean search

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this