In this paper we propose a distributed algorithm for model- checking LTL. In particular, we explore the possibility of performing
nested depth-first search algorithm in distributed SPIN. A distributed version of the algorithm is presented, and its complexity
is discussed.
This work has been supported in part by the Grant Agency of Czech Republic grants