@incollection{eprints170,
            note = {The original publication is available at www.springerlink.com},
       publisher = {Springer},
          author = {Stefan Edelkamp and Alberto Lluch-Lafuente and Stefan Leue},
       booktitle = {Model Checking Software (SPIN '01)},
          editor = {Matthew B. Dwyer},
          volume = {2057},
           pages = {57--79},
           title = {Directed Explicit Model Checking with HSF-SPIN},
          series = {Lecture Notes in Computer Science},
            year = {2001},
             url = {http://eprints.imtlucca.it/170/},
        abstract = {We present the explicit state model checker HSF-SPIN which is based on the model checker SPIN and its Promela modeling language. HSF-SPIN incorporates directed search algorithms for checking safety and a large class of LTL-specified liveness properties. We start off from the A* algorithm and define heuristics to accelerate the search into the direction of a specified failure situation. Next we propose an improved nested depth-first search algorithm that exploits the structure of Promela Never-Claims. As a result of both improvements, counterexamples will be shorter and the explored part of the state space will be smaller than with classical approaches, allowing to analyze larger state spaces. We evaluate the impact of the new heuristics and algorithms on a set of protocol models, some of which are real-world industrial protocols.
}
}