In the case of multi-threading as found in contemporary programming
languages, parallel processes are interleaved according to what is known as a
process-scheduling policy in the field of operating systems. In a previous
paper, we extend ACP with this form of interleaving. In the current paper, we
do so with the variant of ACP known as ACPϵ​. The choice of
ACPϵ​ stems from the need to cover more process-scheduling policies.
We show that a process-scheduling policy supporting mutual exclusion of
critical subprocesses is now covered.Comment: 15 pages, there is noticeable text overlap with earlier papers
(arXiv:1912.10041, arXiv:1703.06822); 15 pages, Section 3.2 improved; 15
pages, minor improvements including replacement of reference at end Section
3.