Parallel algorithms for finding SCCs in implicitly given graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4346 LNCS, Issue , 2007, Pages 316-330

  Barnat, Jiří ^a   Moravec, Pavel ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING;

SCC DETECTION;

PARALLEL ALGORITHMS;

EID: 36348957769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70952-7_22     Document Type: Conference Paper

References (21)

1. Nancy Amato. Improved processor bounds for parallel algorithms for weighted directed graphs. Inf. Process. Lett., 45(3):147-152, 1993.
2. J. Barnat, L. Brim, I. Černá, P. Moravec, P. Ročkai, and P. Šimeček. Divine - a tool for distributed verification. To appear in proceedings of CAV 2006.
3. J. Barnat, L. Brim, and J. Chaloupka. Parallel Breadth-First Search LTL Model-Checking. In 18th IEEE International Conference on Automated Software Engineering (ASE'03), pages 106-115. IEEE Computer Society, Oct. 2003.
4. G. Behrmann. A performance study of distributed timed automata reachability analysis. In Proc. Workshop on Parallel and Distributed Model Checking, volume 68 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002.
5. L. Brim, I. Černá, P. Moravec, and J. Šimša. Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. In 5th International Conference on Formal Methods in Computer-Aided Design (FMCAD'04), volume 3312 of LNCS, pages 352-366. Springer-Verlag, 2004.
6. S. Caselli, G. Conte, and P. Marenzoni. Parallel state space exploration for GSPN models. In G. De Michelis and M. Diaz, editors, Applications and Theory of Petri Nets 1995, volume 935 of LNCS, pages 181-200. Springer-Verlag, 1995.
7. G. Ciardo, J. Gluckman, and D.M. Nicol. Distributed State Space Generation of Discrete-State Stochastic Models. INFORMS Journal of Computing, 1997.
8. Frank Ciesinski and Christel Baier. LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems, 2006.
9. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
10. Richard Cole and Uzi Vishkin. Faster optimal parallel prefix sums and list ranking. Inf. Comput., 81(3):334-352, 1989.
11. K. Fisler, R. Fraer, G. Kamhi, M. Y. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In Proc. Tools and Algorithms for Construction and Analysis of Systems, volume 2031 of LNCS, pages 420-434. Springer, 2001.
12. Lisa K. Fleischer, Bruce Hendrickson, and Ali Pinar. On identifying strongly connected components in parallel. Lecture Notes in Computer Science, 1800:505-511, 2000.
13. H. Garavel, R. Mateescu, and I.M Smarandache. Parallel State Space Construction for Model-Checking. In Proceedings of the 8th International SPIN Workshop on Model Checking of Software (SPIN'01), volume 2057 of LNCS, pages 200-216. Springer-Verlag, 2001.
14. Hillel Gazit and Gary L. Miller. An improved parallel algorithm that computes the bfs numbering of a directed graph. Inf. Process. Lett., 28(2):61-65, 1988.
15. William McLendon III, Bruce Hendrickson, Steven J. Plimpton, and Lawrence Rauchwerger. Finding strongly connected components in distributed graphs. J. Parallel Distrib. Comput., 65(8):901-910, 2005.
16. F. Lerda and R. Sisto. Distributed-memory model checking with SPIN. In Proceedings of the 6th International SPIN Workshop on Model Checking of Software (SPIN'99), volume 1680 of LNCS. Springer-Verlag, 1999.
17. S. Orzan. On Distributed Verification and Verified Distribution. PhD thesis, Free University of Amsterdam, 2004.
18. S.M. Orzan and J.C. van de Pol. Detecting strongly connected components in large distributed state spaces. Technical Report SEN-E0501, CWI, 2005.
19. John H. Reif. Depth-first search is inherently sequential. Information Processing Letters, 20(5):229-234, June 1985.
20. R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on computing, pages 146-160, 1972.
21. U.Stern and D. L. Dill. Parallelizing the murφ verifier. In O. Grumberg, editor, Proceedings of Computer Aided Verification (CAV '97), volume 1254 of LNCS, pages 256-267. Springer-Verlag, 1997.