Probabilistic process algebra and strategic interleaving

TL;DR

This paper introduces a probabilistic extension of algebraic process theory (ACP) that incorporates strategic interleaving based on process-scheduling policies, enhancing modeling of concurrent probabilistic systems.

Contribution

It develops a probabilistic ACP framework with a novel form of strategic interleaving guided by process-scheduling policies, bridging process algebra and operating system scheduling.

Findings

Probabilistic choices are resolved before composition choices.

Extended ACP with process-scheduling policies for probabilistic systems.

Framework models concurrent systems with strategic interleaving.

Abstract

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.