R. Alur, S. Chaudhuri, K. Etessami, and P. Madhusudan, On-the-Fly Reachability and Cycle Detection for Recursive State Machines, TACAS'05, pp.61-76, 2005.
DOI : 10.1007/978-3-540-31980-1_5

]. I. Cerná and R. Pelánek, Distributed explicit fair cycle detection (set based approach ), SPIN'03, pp.49-73, 2003.

C. Courcoubetis, M. Y. Vardi, P. Wolper, and M. Yannakakis, Memory-efficient algorithm for the verification of temporal properties, CAV'90, pp.233-242, 1991.

J. Couvreur, On-the-fly verification of temporal logic, FM'99, pp.253-271, 1999.

J. Couvreur, A. Duret-lutz, and D. Poitrenaud, On-the-fly emptiness checks for generalized Büchi automata, SPIN'05, pp.143-158, 2005.

E. W. Dijkstra, EWD 376: Finding the maximum strong components in a directed graph, 1973.

A. Duret-lutz and D. Poitrenaud, SPOT: an extensible model checking library using transition-based generalized buchi automata, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings., pp.76-83, 2004.
DOI : 10.1109/MASCOT.2004.1348184
URL : https://hal.archives-ouvertes.fr/hal-01496158

H. N. Gabow, Path-based depth-first search for strong and biconnected components, Information Processing Letters, vol.74, issue.3-4, pp.107-114, 2000.
DOI : 10.1016/S0020-0190(00)00051-X

H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.246-251, 1983.
DOI : 10.1145/800061.808753

A. Gaiser and S. Schwoon, Comparison of algorithms for checking emptiness on Büchi automata, MEMICS'09, 2009.

J. Geldenhuys and A. Valmari, Tarjan???s Algorithm Makes On-the-Fly LTL Verification More Efficient, TACAS'04, pp.205-219, 2004.
DOI : 10.1007/978-3-540-24730-2_18

J. Geldenhuys and A. Valmari, More efficient on-the-fly LTL verification with Tarjan's algorithm, Theoretical Computer Science, vol.345, issue.1, pp.60-82, 2005.
DOI : 10.1016/j.tcs.2005.07.004

P. Godefroid, G. J. Holzmann, and D. Pirottin, State space caching revisited, CAV'92, pp.178-191, 1992.

H. Hansen and J. Geldenhuys, Cheap and Small Counterexamples, 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods, pp.53-62, 2008.
DOI : 10.1109/SEFM.2008.18

G. J. Holzmann, On limits and possibilities of automated protocol analysis, PSTV'87, pp.339-344, 1987.

E. Nuutila and E. Soisalon-soininen, On finding the strongly connected components in a directed graph, Information Processing Letters, vol.49, issue.1, pp.9-14, 1994.
DOI : 10.1016/0020-0190(94)90047-7

M. M. Patwary, J. R. Blair, and F. Manne, Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure, SEA'10, pp.411-423, 2010.
DOI : 10.1007/978-3-642-13193-6_35

R. Pelánek, BEEM: Benchmarks for Explicit Model Checkers, Proc. of the 14th international SPIN conference on Model checking software, pp.263-267, 2007.
DOI : 10.1007/978-3-540-73370-6_17

R. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

R. E. Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM, vol.22, issue.2, pp.215-225, 1975.
DOI : 10.1145/321879.321884