A method for synthesizing code for the software component of a system is proposed. The specification is given as a set of concurrent processes that communicate through channels. Each process is a sequential program that may contain data-dependent control statements. The synthesized software consists of a set of tasks. A task is generated by analyzing the computation associated to the occurrence of an event at each input port connected to the environment. Our task generation and scheduling algorithm guarantees that task execution can be performed with a finite amount of inter-task buffer memory under arbitrary input streams. Petri nets are used as the underlying model to formally analyze our algorithms. This model is also used to derive several algorithms for optimizing code generation for the set of tasks yielding compact and high-performance software implementations.