Abstract
In this paper, we characterize the attractors of disjunctive Boolean networks with strongly connected dependency graphs and present a method for computing their basins of attraction. Additionally, we investigate the height of such networks — defined as the maximum number of iterations required to reach a periodic orbit.