In this paper, we use PAFAS (Process Algebra for Faster Asynchronous Systems) to compare the worst-case efficiency of three bounded-buffer implementations: Fifo, Pipe and Buff. Fifo implements the buffer as a first-in-first-out queue, Pipe implements the buffer as a pipeline queue and Buff implements the buffer as circular queue in an array. We contrast our results with those in [2] and [10] which also aim at comparing the three implementations of the bounded buffer according to some efficiency measure.