Concrete process algebra
J. C. M. Baeten, Chris Verhoef · TU/e Research Portal · 1995
Concrete process algebraAlgebra may be considered, in its most general form, as the science which treats of the combinations of arbitrary signs and symbols by means of defined through arbitrary laws ... [Peackock, 1830].2 Concrete sequential processesIn this section we will introduce some basic concepts that can be found in process algebra.We will do this in a modular way.That is, first we treat a basic theory that is the kernel for all the other theories that we will discuss subsequently.The basic theory describes finite, concrete, sequential nondeterministic processes.Then we add features to this kernel that are known to be important in process algebra: for instance, deadlock or recursion to mention a few.Such features make the kernel more powerful for both theoretical and practical purposes.We also show that each feature is a so-called conservative extension of the original theory; thus, we may argue that our approach is modular.