Avoiding State Explosion for Distributed Systems with Timestamps

This paper describes a reduction technique which is very useful against the state explosion problem which occurs when model checking many distributed systems. Timestamps are often used to keep track of the relative order of events. They are usually implemented with very large counters and therefore they generate state explosion. The aim of this paper is to present a very efficient reduction of the state space generated by a model checker when using timestamps. The basic idea is to map the timestamps values to the smallest possible range. This is done dynamically and on-the-fly by adding to the model checker a call to a reduction function after each newly generated state. Our reduction works for model checkers using explicit state enumeration and does not require any change in the model. Our method has been applied to an industrial example and the reduction obtained was spectacular.

• Type: Conference
• Year: 2001
• Where: FM
• Authors: Fabrice Derepas, Paul Gastin, David Plainfossé
• Keywords: FM 2001, Formal Methods, Model Checkers, State Explosion, State Explosion Problem