The problem of scheduling hard real-time periodic task sets on a single processor with the rate of monotonic scheduler is studied. The feasibility of test given by Liu and Layland, based on the least upper bound of the utilization factor, is analyzed. It is shown that the result is incomplete and that the argument is incorrect. This result is completed and corrected.SCOPUS: ar.jinfo:eu-repo/semantics/publishe