J. Barnat, L. Brim, and P. Rockai, Parallel partial order reduction with topological sort proviso, SEFM'10, pp.222-231, 2010.

V. Bloemen and J. Van-de-pol, Multi-core scc-based ltl model checking, HVC'16, pp.18-33, 2016.

V. Bloemen, A. Laarman, and J. Van-de-pol, Multi-core on-the-fly scc decomposition, vol.51, 2016.

D. Bosnacki, S. Leue, and A. Lafuente, Partial-order reduction for general state exploring algorithms, SPIN'06, vol.3925, pp.271-287

D. Bo?na??ki, S. Leue, and A. Lluch-lafuente, Partial-order reduction for general state exploring algorithms, International Journal on Software Tools for Technology Transfer (STTT), vol.11, issue.1, pp.39-51, 2009.

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

A. Duret-lutz, F. Kordon, D. Poitrenaud, and E. Renault, Heuristics for checking liveness properties with partial order reductions, ATVA'16, vol.9938, pp.340-356, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01368309

A. Duret-lutz, A. Lewkowicz, A. Fauchille, T. Michaud, E. Renault et al., Spot 2.0 -a framework for LTL and ?-automata manipulation, ATVA'16, vol.9938, pp.122-129, 2016.

S. Evangelista and C. Pajault, Solving the ignoring problem for partial order reduction, International Journal on Software Tools for Technology Transfer, vol.12, issue.2, pp.155-170, 2010.

S. Evangelista, A. Laarman, L. Petrucci, and J. Van-de-pol, Improved multi-core nested depth-first search, ATVA'12, vol.7561, pp.269-283

H. Hansen and A. Valmari, Safety property-driven stubborn sets, Reachability Problems, 2016.

G. J. Holzmann, D. A. Peled, and M. Yannakakis, On nested depth first search, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol.32, 1996.

G. J. Holzmann, R. Joshi, and A. Groce, Swarm verification techniques, IEEE Transaction on Software Engineering, vol.37, issue.6, pp.845-857, 2011.

A. Laarman and D. Faragó, Improved on-the-fly livelock detection, NASA Formal Methods (NFM'13), pp.32-47, 2013.

A. Laarman, E. Pater, J. Pol, and H. Hansen, Guard-based partial-order reduction. STTT, pp.1-22, 2014.

A. W. Laarman and A. J. Wijs, Partial-order reduction for multi-core ltl model checking, HVC 2014, vol.8855, pp.267-283, 2014.

F. Lerda and R. Sisto, Distributed-memory model checking with spin, International SPIN Workshop on Model Checking of Software, pp.22-39, 1999.

R. Nalumasu and G. Gopalakrishnan, An efficient partial order reduction algorithm with an alternative proviso implementation, vol.20, pp.231-247, 2002.

E. Pater, Partial order reduction for pins, 2011.

R. Pelánek, BEEM: benchmarks for explicit model checkers, SPIN'07, vol.4595, pp.263-267, 2007.

R. Pelánek, Properties of state spaces and their applications, International Journal on Software Tools for Technology Transfer (STTT), vol.10, pp.443-454, 2008.

D. Peled, Combining partial order reductions with on-the-fly model-checking, CAV'94, vol.818, pp.377-390, 1994.

D. Peled, A. Valmari, and I. Kokkarinen, Relaxed visibility enhances partial order reduction, Formal Methods in System Design, vol.19, issue.3, pp.275-289, 2001.

E. Renault, A. Duret-lutz, F. Kordon, and D. Poitrenaud, Variations on parallel explicit model checking for generalized Büchi automata, International Journal on Software Tools for Technology Transfer (STTT), pp.1-21, 2016.

S. Stephen, What's wrong with on-the-fly partial order reduction, CAV'19, pp.478-495, 2019.

R. Tarjan, Depth-first search and linear graph algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.

A. Valmari, Stubborn sets for reduced state space generation, ICATPN'91, vol.618, pp.491-515, 1991.

A. Valmari, More stubborn set methods for process algebras, Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday, pp.246-271, 2017.