[ ILPnet2 | Library | Newsletter | CSCW | Education | End-User Club | Events | Nodes | Systems | Applications | Members only ] We consider a simple language L containing the fork-statement. For this language we introduce a non-deterministic transition system which defines all interleavings consisting of baisc steps, for all possible executions of a program. We prove that, although on the execution level there is much nondeterminism, this nondeterminism disappears because all executions deliver the same output stream (or a prefix of it), given the same input stream. This proves the Kahn principle for linear, nondeterministic dynamic networks.