Partial-Order Reduction for General State Exploring Algorithms


Dateien zu dieser Ressource

Prüfsumme: MD5:d3d070c26b54dbd1c458872521b61318

BOSNAČKI, Dragan, Stefan LEUE, Alberto LLUCH-LAFUENTE, 2006. Partial-Order Reduction for General State Exploring Algorithms

@techreport{Bosnacki2006Parti-5535, series={Technical Report, Chair for Software Engineering, University of Konstanz}, title={Partial-Order Reduction for General State Exploring Algorithms}, year={2006}, number={soft-05-02}, author={Bosnački, Dragan and Leue, Stefan and Lluch-Lafuente, Alberto} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:available rdf:datatype="">2011-03-24T15:56:16Z</dcterms:available> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> <dc:date rdf:datatype="">2011-03-24T15:56:16Z</dc:date> <dcterms:rights rdf:resource=""/> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Leue, Stefan</dc:creator> <dcterms:issued>2006</dcterms:issued> <dcterms:isPartOf rdf:resource=""/> <dcterms:title>Partial-Order Reduction for General State Exploring Algorithms</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:language>eng</dc:language> <bibo:uri rdf:resource=""/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:hasPart rdf:resource=""/> <dc:format>application/pdf</dc:format> <dc:contributor>Bosnački, Dragan</dc:contributor> <dc:creator>Bosnački, Dragan</dc:creator> <dc:rights>terms-of-use</dc:rights> <dspace:hasBitstream rdf:resource=""/> <dc:creator>Lluch-Lafuente, Alberto</dc:creator> <dc:contributor>Leue, Stefan</dc:contributor> <dc:contributor>Lluch-Lafuente, Alberto</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Partial_Order_Reduction_for_General_State_Exploring_Algorithms.pdf 51

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto