Succession-diagram-based Markov chains reveal the attractor landscape of asynchronous Boolean networks
The paper introduces SD Markov chains to analyze Boolean network dynamics by reducing state space using trap spaces, accurately capturing attractors and their properties.