Distributed Explicit Fair Cycle Detection

Autoři ČERNÁ Ivana PELÁNEK Radek
Druh Článek ve sborníku
Citace ČERNÁ, Ivana a Radek PELÁNEK. Distributed Explicit Fair Cycle Detection. In SPIN Workshop 2003. Portland (Oregon, USA): Springer-Verlag, 2003. s. 49-74, 25 s. ISBN 3-540-40117-2.
Originální jazyk angličtina
Obor Informatika
Klíčová slova distributed model checking; cycle detection

The fair cycle detection problem is at the heart of both LTL and fair CTL model checking. This paper presents a new distributed scalable algorithm for explicit fair cycle detection. Our method combines the simplicity of the distribution of explicitly presented data structure and the features of symbolic algorithm allowing for an efficient parallelisation. If a fair cycle (i.e. counterexample) is detected, then the algorithm produces a cycle, which is in general shorter than that produced by depth-first search based algorithms. Experimental results confirm that our approach outperforms that based on a direct implementation of the best sequential algorithm.

Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info