In: Theoretical Computer Science 238 (1-2), pages 161-181. May 2000.
Abstract: A new formulation for elementary net processes and their sequential composition (concatenation) is given. Algebra of subsets of the monoid of processes, that is, process languages, is developed. Analysis and synthesis problems for this algebra are stated and solved. A type of concurrency represented in the processes is discussed, as well as relation between string languages and process languages or branching processes.
Keywords: Elementary net; Process; Process language; Analysis and synthesis; Concurrency.