Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - A Note on On-The-Fly Verification Algorithms


Stefan Schwoon and Javier Esparza. A note on on-the-fly verification algorithms. Technical Report 2004/06, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, November 2004.


The 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.

Suggested BibTeX entry:

    author = {Stefan Schwoon and Javier Esparza},
    institution = {Universit{\"a}t Stuttgart, Fakult\"at Informatik, Elektrotechnik und Informationstechnik},
    month = {November},
    number = {2004/06},
    title = {A Note on On-The-Fly Verification Algorithms},
    year = {2004}

GZipped PostScript (93 kB)
PDF (179 kB)
See ...
Conference version