A boundary between decidability and undecidability for parallel program schemata (Extended Abstract)
Raymond E. Miller · 1972
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 [1] showing that the deletion of the hypothesis of repetition-freeness from the decidability theorems produces undecidability.