Positive systems in the behavioural approach are introduced as sets of non-negative trajectories that satisfy a closure condition with respect to linear combinations with non-negative coefficients. Completeness and finite memory properties an discussed and compared with the analogous properties of linear shift invariant behaviours.