Forschungsberichte Technische Universität München, Report-Nr: TUM-I 8706, 1987.
Abstract: The theoretical version of Hoare's CSP is related to formal language theory. In general theoretical CSP is Turing powerful, but if the recursion is restricted sensibly every terminating behaviour is regular. The proof uses systematically constructed safe Petri nets. This additionally yields a very simple operational semantics.