relation: http://eprints.imtlucca.it/158/
title: Partial-Order Reduction for General State Exploring Algorithms
creator: Bosnacki, Dragan
creator: Leue, Stefan
creator: Lluch-Lafuente, Alberto
subject: QA75 Electronic computers. Computer science
description: 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.  }
publisher: Springer
contributor: Valmari, Antti
date: 2006
type: Book Section
type: PeerReviewed
identifier:   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)  
relation: http://dx.doi.org/10.1007/11691617_16
relation: 10.1007/11691617_16