TY  - CHAP
SN  - 3-540-42124-6
N2  - 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.

M1  - 2057
AV  - public
TI  - Directed Explicit Model Checking with HSF-SPIN
UR  - http://dx.doi.org/10.1007/3-540-45139-0_5
N1  - The original publication is available at www.springerlink.com
ID  - eprints170
EP  - 79
T2  - Model Checking Software (SPIN '01)
A1  - Edelkamp, Stefan
A1  - Lluch-Lafuente, Alberto
A1  - Leue, Stefan
PB  - Springer
SP  - 57
T3  - Lecture Notes in Computer Science
Y1  - 2001///
ED  - B. Dwyer, Matthew
ER  -