For applying the sweep-line method, a state space reduction technique, it is necessary to provide an automatic calculation of a progress measure. In [1], such a calculation has been proposed for Petri nets. The approach presented there may lead to suboptimal results, therefore the author suggested possible optimizations. In this paper, we check whether the proposed optimization goals indeed lea...

The sweep-line method exploits intrinsic progress in concurrent systems to alleviate the state explosion problem in explicit state model checking. The concept of progress makes it possible to delete states from the memory during state space exploration and thereby reduce peak memory usage. The contribution of this paper is twofold. First, we provide a coherent presentation of the sweep-line the...

The sweep-line method is an explicit-state model checking technique that uses a notion of progress to delete states from internal memory during state space exploration and thereby reduce peak memory usage. The sweep-line algorithm relies on the use of a priority queue where the progress value assigned to a state determines the priority of the state. In earlier implementations of the sweep-line ...

The Voronoi diagram is an important data structure in computational geometry. Given n sites in the plane, the Voronoi diagram partitions the plane into n regions. The region of a site p consists of all those points that lie closer to p than to any of the other sites. For a survey on Voronoi diagrams and their applications we refer to Aurenhammer [1]. A generalization of the sweep line method of...