Probabilistic process algebra and strategic interleaving
Logic in Computer Science
2020-12-23 v6 Programming Languages
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.
Cite
@article{arxiv.1912.10041,
title = {Probabilistic process algebra and strategic interleaving},
author = {C. A. Middelburg},
journal= {arXiv preprint arXiv:1912.10041},
year = {2020}
}
Comments
30 pages, major revision with adaptation of example from arXiv:2003.00473 incorporated (also text overlap with arXiv:1703.06822)