Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-2544
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSchwoon, Stefande
dc.contributor.authorEsparza, Javierde
dc.date.accessioned2005-04-07de
dc.date.accessioned2016-03-31T07:58:30Z-
dc.date.available2005-04-07de
dc.date.available2016-03-31T07:58:30Z-
dc.date.issued2004de
dc.identifier.other117300632de
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:bsz:93-opus-22281de
dc.identifier.urihttp://elib.uni-stuttgart.de/handle/11682/2561-
dc.identifier.urihttp://dx.doi.org/10.18419/opus-2544-
dc.description.abstractThe automata-theoretic approach to verification of LTL relies on an algorithm for finding accepting cycles in the product of the system and a Büchi automaton for the negation of the formula. Explicit-state model checkers typically construct the product space "on the fly" and explore the states using depth-first search. We survey algorithms proposed for this purpose and propose two improved algorithms, one based on nested DFS, the other on strongly connected components. We compare these algorithms both theoretically and experimentally and determine cases where both algorithms can be useful.en
dc.language.isoende
dc.relation.ispartofseriesTechnischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2004,6de
dc.rightsinfo:eu-repo/semantics/openAccessde
dc.subject.classificationModel checking , Tiefensuchede
dc.subject.ddc004de
dc.subject.otherLTLde
dc.subject.otherdepth-first searchen
dc.titleA note on on-the-fly verification algorithmsen
dc.typeworkingPaperde
dc.date.updated2013-07-05de
ubs.fakultaetFakultät Informatik, Elektrotechnik und Informationstechnikde
ubs.institutInstitut für Formale Methoden der Informatikde
ubs.opusid2228de
ubs.publikation.typArbeitspapierde
ubs.schriftenreihe.nameTechnischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnikde
Appears in Collections:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Files in This Item:
File Description SizeFormat 
TR_2004_06.pdf179,47 kBAdobe PDFView/Open


Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.