Abstract
Single-pass instruction sequences under execution are considered to
produce behaviours to be controlled by some execution environment.
Threads as considered in thread algebra model such behaviours: upon each action performed by a thread, a reply from its execution
environment determines how the thread proceeds.
Threads in turn can be looked upon as producing processes as
considered in process algebra.
We show that, by apposite choice of basic instructions, all processes
that can only be in a finite number of states can be produced by
single-pass instruction sequences.