Process algebra, process scheduling, and mutual exclusion

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$_\epsilon$. The choice of ACP$_\epsilon$ 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.

Probabilistic process algebra and strategic interleaving

We first present a probabilistic version of ACP that rests on the principle that probabilistic choices are always resolved before choices involved in alternative composition and parallel composition are resolved and then extend this probabilistic version of ACP with a form of interleaving in which parallel processes are interleaved according to what is known as a process-scheduling policy in the field of operating systems. We use the term strategic interleaving for this more constrained form of interleaving. The extension covers probabilistic process-scheduling policies.Comment: 30 pages, major revision with adaptation of example from arXiv:2003.00473 incorporated (also text overlap with arXiv:1703.06822