A boundary between decidability and undecidability for parallel program schemata

Some theorems showing undecidability for computational commutativity, boundedness, termination and determinacy of parallel program schemata are given. These results are then compared with contrasting decidability results in [ I] showing that the deletion of the hypothesis of repetition-freeness from the decidability theorems produces undecidability.