Abstract
Translating sequential programs into concurrent ones to increase the time performance by making excessive use of the available recourses (processors) in the system is an important part of the compiler of concurrent programming languages. We present three algorithms for transforming sequential processes of a net system into concurrent ones. The first two are applied to programs with bounded behaviour, and the last is applied to the systems for which the maximal parallel semantics is the same as the parallel semantics. These algorithms are based on: trace languages, shift-left and case graphs. Though they are only presented for net systems, they can be adapted for different models of concurrent systems as well.