Instruction sequences for the production of processes

TL;DR

This paper demonstrates that finite-state processes can be generated using single-pass instruction sequences by carefully selecting basic instructions, linking thread algebra to process algebra.

Contribution

It shows how to produce all finite-state processes through single-pass instruction sequences with appropriate basic instructions, bridging thread and process algebra.

Findings

Finite-state processes can be generated by instruction sequences.

Single-pass instruction sequences can produce behaviors modeled by process algebra.

The approach links thread algebra with process algebra through instruction sequences.

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.