Corrigendum: `` Control System Model for Critically Timed Success''

My paper presented a model of a control system for critically timed sources, based on the concept of state vector sequences, and used the model to prove a conjecture of Hellerman [1, p. 233] concerning an algorithm to construct such a control system. Subsequent to publication, Professor M. A. Bonnccelli (Instituto di Scienze dell'Informazione, Universita di Pisa) drew my attention to an article of Liu and Layland [2] on scheduhng algorithms. He pointed out that, substituting "processor" for "bus," "task" for "critical source," and "deadline" for "time intervalp," Hellerman's algorithm corresponds to the deadline driven scheduling algorithm given in [2]. Hence it is possible to prove Hellerman's conjecture in a different manner using results from [2].