The notion of an associative omega-product is applied to processes. Processes are one of the ways to represent behavior of Petri nets. They have been studied for some years as an alternative to traces and dependence graphs. One advantage of processes, as compared to traces, is a very simple way to define infinite concatenation. We take a closer look at this operation, and show that it is a free associative omega-product of finite processes. Its associativity simplifies some arguments about infinite concatenation, as illustrated by the proof of interleaving theorem.
Roman R. Redziejowski