eprintid: 158
rev_number: 6
eprint_status: archive
userid: 30
dir: disk0/00/00/01/58
datestamp: 2011-03-31 14:06:37
lastmod: 2011-07-11 14:34:34
status_changed: 2011-03-31 14:06:37
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: Bosnacki, Dragan
creators_name: Leue, Stefan
creators_name: Lluch-Lafuente, Alberto
creators_id: 
creators_id: 
creators_id: alberto.lluch@imtlucca.it
title: Partial-Order Reduction for General State Exploring Algorithms
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: © Springer-Verlag Berlin Heidelberg 2006. The original publication is available at www.springerlink.com.
abstract: An important component of partial-order based reduction algorithms is the condition that prevents action ignoring, commonly known as the cycle proviso. In this paper we give a new version of this proviso that is applicable to a general search algorithm skeleton also known as the General State Expanding Algorithm (GSEA). GSEA maintains a set of open (visited but not expanded) states from which states are iteratively selected for exploration and moved to a closed set of states (visited and expanded). Depending on the open set data structure used, GSEA can be instantiated as depth-first, breadth-first, or a directed search algorithm. The proviso is characterized by reference to the open and closed set of states in GSEA. As a result the proviso can be computed in an efficient manner during the search based on local information. We implemented partial-order reduction for GSEA based on our proposed proviso in the tool HSF-SPIN, which is an extension of the model checker SPIN for directed model checking. We evaluate the state space reduction achieved by partial-order reduction according to the proviso that we propose by comparing it on a set of benchmark problems to other reduction approaches. We also compare the use of breadth-first search and A*, two algorithms ensuring that counterexamples of minimal length will be found, together with the proviso that we propose.
}
date: 2006
date_type: published
series: Lecture Notes in Computer Science
volume: 3925
publisher: Springer
pagerange: 271-287
id_number: 10.1007/11691617_16
refereed: TRUE
isbn: 3-540-33102-6
book_title: Model Checking Software (SPIN 2006)
editors_name: Valmari, Antti
official_url: http://dx.doi.org/10.1007/11691617_16
citation:   Bosnacki, Dragan and Leue, Stefan and Lluch-Lafuente, Alberto  Partial-Order Reduction for General State Exploring Algorithms.   In:  Model Checking Software (SPIN 2006).   Lecture Notes in Computer Science, 3925 .  Springer, pp. 271-287.  ISBN 3-540-33102-6      (2006)