Distributed explicit fair cycle detection: set based approach

  • Authors:
  • Ivana Černá;Radek Pelánek

  • Affiliations:
  • Department of Computer Science, Faculty of Informatics, Masaryk University Brno, Czech Republic;Department of Computer Science, Faculty of Informatics, Masaryk University Brno, Czech Republic

  • Venue:
  • SPIN'03 Proceedings of the 10th international conference on Model checking software
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 basedon a direct implementation of the best sequential algorithm.