Publikation:

Partial-order reduction for general state exploring algorithms

Lade...
Vorschaubild

Dateien

bosnacki_214643.pdf
bosnacki_214643.pdfGröße: 413.35 KBDownloads: 316

Datum

2006

Autor:innen

Bošnački, Dragan
Lluch Lafuente, Alberto

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

DOI (zitierfähiger Link)
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

VALMARI, Antti, ed.. Model Checking Software. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 271-287. Lecture Notes in Computer Science. 3925. ISBN 978-3-540-33102-5. Available under: doi: 10.1007/11691617_16

Zusammenfassung

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.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690BOŠ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, 2006, pp. 271-287. Lecture Notes in Computer Science. 3925. ISBN 978-3-540-33102-5. Available under: doi: 10.1007/11691617_16
BibTex
@inproceedings{Bosnacki2006Parti-21464,
  year={2006},
  doi={10.1007/11691617_16},
  title={Partial-order reduction for general state exploring algorithms},
  number={3925},
  isbn={978-3-540-33102-5},
  publisher={Springer Berlin Heidelberg},
  address={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:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/21464">
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-02-06T08:10:30Z</dcterms:available>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-02-06T08:10:30Z</dc:date>
    <dc:contributor>Lluch Lafuente, Alberto</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>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/21464/1/bosnacki_214643.pdf"/>
    <dc:language>eng</dc:language>
    <dcterms:issued>2006</dcterms:issued>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Lluch Lafuente, Alberto</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/21464"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Leue, Stefan</dc:contributor>
    <dc:contributor>Bošnački, Dragan</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <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:creator>Leue, Stefan</dc:creator>
    <dc:creator>Bošnački, Dragan</dc:creator>
    <dcterms:title>Partial-order reduction for general state exploring algorithms</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/21464/1/bosnacki_214643.pdf"/>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen