133
P/C: finite circular buffer of size k
n
can consume only when number N of
(consumable) items is at least 1 (now: N!=in-out)
n
can produce only when number E of empty spaces
is at least 1
