Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können kommenden Montag und Dienstag keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted next Monday and Tuesday.)

Partial-order reduction for general state exploring algorithms

Cite This

Files in this item

Checksum: MD5:0f8939570e106de18165dd8941f77a21

BOŠNAČKI, Dragan, Stefan LEUE, Alberto LLUCH LAFUENTE, 2006. Partial-order reduction for general state exploring algorithms. In: VALMARI, Antti, ed.. Model Checking Software. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 271-287. ISBN 978-3-540-33102-5. Available under: doi: 10.1007/11691617_16

@inproceedings{Bosnacki2006Parti-21464, title={Partial-order reduction for general state exploring algorithms}, year={2006}, doi={10.1007/11691617_16}, number={3925}, isbn={978-3-540-33102-5}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Model Checking Software}, pages={271--287}, editor={Valmari, Antti}, author={Bošnač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=""> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:title>Partial-order reduction for general state exploring algorithms</dcterms:title> <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:rights>terms-of-use</dc:rights> <dc:contributor>Leue, Stefan</dc:contributor> <dcterms:bibliographicCitation>Model checking software : 13th International SPIN Workshop, Vienna, Austria, March 30 - April 1, 2006; proceedings / Antti Valmari ... (eds.). - Berlin [u.a.] : Springer, 2006. - S. 271-287. - (Lecture Notes in Computer Science ; 3925). - ISBN 978-3-540-33102-5</dcterms:bibliographicCitation> <dcterms:isPartOf rdf:resource=""/> <bibo:uri rdf:resource=""/> <dcterms:issued>2006</dcterms:issued> <dspace:hasBitstream rdf:resource=""/> <dc:date rdf:datatype="">2013-02-06T08:10:30Z</dc:date> <dcterms:available rdf:datatype="">2013-02-06T08:10:30Z</dcterms:available> <dc:contributor>Bošnački, Dragan</dc:contributor> <dcterms:rights rdf:resource=""/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:hasPart rdf:resource=""/> <dc:contributor>Lluch Lafuente, Alberto</dc:contributor> <dc:creator>Bošnački, Dragan</dc:creator> <dc:creator>Leue, Stefan</dc:creator> <dc:language>eng</dc:language> <dc:creator>Lluch Lafuente, Alberto</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

bosnacki_214643.pdf 323

This item appears in the following Collection(s)

Search KOPS


My Account