A schedule for a sequential finite-state machine defines a distribution of statements on control steps taking into account constraints on time and resources. A net schedule defines both a partial precedence and concurrent execution of the statements under the same constraints. The author introduces a new net scheduling and allocation model, method, and techniques that permit generation of net schedules minimizing either the execution time or resources. The net schedule is a source to synthesize a sequential schedule with chaining, multicycling, and pipelining, or to structure synthesis directly. Experimental results show the net schedule execution time to be more than 20% less than the sequential schedule execution time in the case of variable execution time of statements. The theoretical results are used in VHDL-based high-level synthesis AHILES system.