Automatic verification of liveness (or weak liveness as termed by other authors) sufers from exponential growth of the prolem with respect to the number n of system components. Using a model of parallelism based on regular language theory and imposing the condition of a hierarchical structure of the system, the author arrives at a complexity of O(n).