Boolean networks (BNs)play a crucial role in modeling and analyzing biological systems. One of the central issues in the analysis of BNs is attractor detection, i.e., identification of all possible attractors. This problem becomes more challenging for large asynchronous random Boolean networks (ARBNs)because of the asynchronous and non-deterministic updating scheme. In this paper, we present and formally prove several relations between feedback vertex sets (FVSs)and dynamics of BNs. From these relations, we propose an FVS-based method for detecting attractors in ARBNs. Our approach relies on the principle of removing arcs in the state transition graph to get a candidate set and the reachability property to filter the candidate set. We formally prove the correctness of our method and show its efficiency by conducting experiments on real biological networks and randomly generated N- K networks. The obtained results are very promising since our method can handle large networks whose sizes are up to 101 without using any network reduction technique.