Abstract
In process algebras such as ACP, parallel processes are considered to
be interleaved in an arbitrary way.
In the case of multi-threading as found in contemporary programming
languages, parallel processes are actually interleaved according to some
interleaving strategy.
Interleaving strategies are also known as process-scheduling policies.
In many systems, for instance hardware/software systems, we have to do
with both parallel processes that may best be considered to be
interleaved in an arbitrary way and parallel processes that may best be
considered to be interleaved according to some interleaving strategy.
Therefore, we extend ACP in this paper with the latter form of
interleaving.
View-only version of article
Preprint available:
arXiv:1703.06822 [cs.LO]