  This paper is a contribution to exploring and analyzing space-improvements in
concurrent programming languages, in particular in the functional
process-calculus CHF. Space-improvements are defined as a generalization of the
corresponding notion in deterministic pure functional languages. The main part
of the paper is the O(n*log n) algorithm SpOptN for offline space optimization
of several parallel independent processes. Applications of this algorithm are:
(i) affirmation of space improving transformations for particular classes of
program transformations; (ii) support of an interpreter-based method for
refuting space-improvements; and (iii) as a stand-alone offline-optimizer for
space (or similar resources) of parallel processes.
