A Sweep-Line Method for Biichi Automata-based Model Checking

摘要

The sweep-line method allows explicit state model checkers to delete states from memory on-the-fly during state space exploration, thereby lowering the memory demands of the verification procedure. The sweep-line method is based on a least-progress-first search order that prohibits the immediate use of standard on-the-fly Biichi automata-based model checking algorithms that rely on a depth-first search order in the search for an acceptance cycle. This paper proposes and experimentally evaluates an algorithm for Biichi automata-based model checking compatible with the search order and deletion of states prescribed by the sweep-line method.