Directed Explicit Model Checking with HSF-SPIN

Stefan Edelkamp, Alberto Lluch Lafuente, Stefan Leue

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


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.
Original languageEnglish
Title of host publicationModel Checking Software : 8th International SPIN Workshop Toronto, Canada, May 19–20, 2001 Proceedings
PublisherSpringer Berlin Heidelberg
Publication date2001
ISBN (Print)978-3-540-42124-5
ISBN (Electronic)978-3-540-45139-6
Publication statusPublished - 2001
Externally publishedYes
Event8th International SPIN Workshop on Model Checking Software - Toronto, Canada
Duration: 19 May 200120 May 2001
Conference number: 8


Workshop8th International SPIN Workshop on Model Checking Software
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Directed Explicit Model Checking with HSF-SPIN'. Together they form a unique fingerprint.

Cite this